Hi Friend,

Try the following code:

1)InsertionSort.java:

public class InsertionSort {
public static void sort(String[] array) {
int N = array.length;
for (int i = 1; i < N; i++)
for (int j = i; j > 0; j--)
if (array[j-1].compareTo(array[j]) > 0)
change(array, j, j-1);
else break;
}
private static void change(Comparable[] a, int i, int j) {
Comparable swap = a[i];
a[i] = a[j];
a[j] = swap;
}
public static void main(String[] args) {
String[] array ={"S","D", "A","B","Z", "M","O", "L","H", "Y"};
sort(array);
for (int i = 0; i < array.length; i++) {
System.out.print(array[i] + " ");
}
System.out.println();
}
}

2)SelectionSOrt.java:

import java.util.*;

public class SelectionSort{
public static void main(String a[]){
String array[] = {"S","D", "A","B","Z", "M","O", "L","H", "Y"};
sort(array, array.length);

System.out.println("Data items in ascending order");
for(int i = 0; i <array.length; i++)
System.out.print(array[i]+" ");
}
public static void sort(String array[], int n) {
for (int x = 0; x < n; x++) {
int min = x;
for (int y = x; y < n; y++) {
if (array[min].compareTo(array[y]) > 0) {
min = y;
}
}
String temp = array[x];
array[x] = array[min];
array[min] = temp;
}
}
}

Hope that it will be helpful for you.
Thanks