很简单,直接上代码:
import java.util.Arrays;
public class InsertionSort {
private final static int MAX_VALUE = 100;
private final static int LENGTH = 10;
public static void main(String[] args) {
int[] A = new int[LENGTH];
// 获得随机数
randomIntArray(A);
System.out.println(Arrays.toString(A));
//排序
sort(A);
System.out.println(Arrays.toString(A));
}
private static void randomIntArray(int[] array) {
if(array == null) return;
for(int i = 0; i < array.length; i++) {
array[i] = (int) (Math.random() * MAX_VALUE);
}
}
/**
* 插入排序法
*/
private static void sort(int[] array) {
int key = 0, i = 0;
if(array == null) return;
for(int j= 1; j < array.length; j++) {
key = array[j];
i = j - 1;
while (i >= 0 && array[i] > key) {
array[i + 1] = array[i];
i -= 1;
}
array[i + 1] = key;
}
}
}