public class HelloJava{
public static void main(String[] args) {
int[] arr1 = new int[] {20,40,90,30,80,70,50};
insertSort(arr1);
int[] arr2 = new int[] {11,52,4,5,65,4,2,1,45};
insertSort(arr2);
}
public static void insertSort(int[] array) {
System.out.println("排序前: ");
for(int i=0; i<array.length; i++) {
System.out.print(array[i]+" ");
}
int temp;
int k;
for(int i=1; i<array.length; i++) {
temp = array[i];
for(k=i-1; k>=0&&temp<array[k]; k--) {
array[k+1] = array[k];
}
array[k+1] = temp;
}
System.out.println();
System.out.println("排序后: ");
for(int i=0; i<array.length; i++) {
System.out.print(array[i]+" ");
}
}
}
直接插入排序算法(java实现)
猜你喜欢
转载自www.cnblogs.com/guangxiaolin/p/9325734.html
今日推荐
周排行