package suanfa;
//插入排序
public class Test1 {
public static void main(String[] args) {
int[] arr = new int[] { 9, 2, 3, 4, 0, 8, 6, 7 };
test(arr);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
}
public static void test(int[] arr) {
// 0-0
// 0-1
// 0-2
// 0- N-1
for (int end = 1; end < arr.length; end++) {
int endPoi = end;
while (endPoi - 1 >= 0 && arr[endPoi - 1] > arr[endPoi]) {
int tmp = arr[endPoi - 1];
arr[endPoi - 1] = arr[endPoi];
arr[endPoi] = tmp;
endPoi--;
}
}
}
}
04-27
4087
07-01
6714
09-14
1154
10-05
1308