public class InsertionSort {
public static void main(String[] args) {
int []a = {5,6,8,7,10,3,4,9,2,11};
sort(a);
print(a);
}
static void sort(int[] a){
for (int i = 1; i<a.length; i++){ //数组第几个元素
for (int j = i; j>0; j--){ // 遍历和前面元素
if (a[j] < a[j-1]){ // 比较
swap(a, j, j-1); //值交换
}
}
}
}
static void swap(int[] a, int i, int j){
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
static void print(int[] arr){
for (int i = 0; i < arr.length; i++){
System.out.print(arr[i] + " ");
}
}
}
09-14