Java中的插入排序。
以下是必需的程序。
示例
public class Tester {
public static void insertionSort(int array[]) {
int n = array.length;
for (int j = 1; j < n; j++) {
int key = array[j];
int i = j-1;
while ( (i > -1) && ( array [i] > key ) ){
array [i+1] = array [i];
i--;
}
array[i+1] = key;
}
}
public static void main(String a[]){
int arr[] = {21,60,32,01,41,34,5};
System.out.println("Before Insertion Sort");
for(int i:arr){
System.out.print(i+" ");
}
System.out.println();
insertionSort(arr); //sorting array using insertion sort
System.out.println("After Insertion Sort");
for(int i:arr){
System.out.print(i+" ");
}
}
}输出结果
Before Insertion Sort 21 60 32 1 41 34 5 After Insertion Sort 1 5 21 32 34 41 60