public static void main(String[] args) {
Random r = new Random();
int size = 10;
int[] array = new int[size];
//排序前,赋值并且打印
System.out.println("排序前:");
for (int i = 0; i < array.length; i++) {
array = r.nextInt(100);
System.out.print(array+" ");
}
System.out.println();
//调用排序方法
insertSort(array);
//排序后,打印输出结果
System.out.println("排序后:");
for (int i = 1; i < array.length; i++) {
System.out.print(array+" ");
}
System.out.println();
}
排序方法的写法
//直接插入排序的方法
public static void insertSort(int[] arr){
int len = arr.length;
for (int i = 2; i < len; i++) {
if(arr<arr[i-1]){
arr[0] = arr;
arr = arr[i-1];
int insertPosition = 0;
for (int j = i-2; j >=0; j--) {
if (arr[j]>arr[0]){
arr[j+1] = arr[j];
}else{
insertPosition = j+1;
break;
}
}
arr[insertPosition] = arr[0];
}
}
}
