public class InsertSort {
public static void main(String[] args) {
int array[]={2,5,7,1,9,34,23,45,12,56,78,78,91,35};
for (int i = 0; i < array.length; i++) {
System.out.print(array[i]+"\t");
}
System.out.println("sort");
long start=System.nanoTime();
Sort(array);
long end=System.nanoTime();
for (int i = 0; i < array.length; i++) {
System.out.print(array[i]+"\t");
}
long time=end-start;
System.out.println("time: "+time+"ns");
}
private static void Sort(int[] array) {
int num=array.length;
for (int i = 1; i < num; i++) {
insert(array,i,array[i]);
}
}
private static void insert(int[] array, int i, int j) {
int num=array.length;
int pos=i-1;
while(pos>=0&&array[pos]>j) {
array[pos+1]=array[pos];
pos--;
}
array[pos+1]=j;
}
}
插入排序
最新推荐文章于 2022-03-28 17:43:34 发布