Insertion Sort

package utils;

public class InsertionSort {

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 <>
System.out.print(array[i] + " ");
}
System.out.println();
}

public static void sort(String[] array) {
int N = array.length;
for (int i = 1; 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;
}

}

/**
######### OUTPUT ###############
A B D H L M O S Y Z

*/

Tag: Study Code Program Java