package sfdl;
public class InsertionSort {
public static void main(String[] args) {
int[] A={5,2,4,6,1,3};
for(int j = 1; j < A.length; j++) {
int key = A[j];
int i = j - 1;
while(i >= 0 && A[i] > key) {
A[i+1] = A[i];
i=i-1;
}
A[i+1] = key;
}
for(int c : A) {
System.out.println(c);
}
}
}
插入排序---java实现
最新推荐文章于 2022-02-25 21:57:21 发布