思路:
代码:
package 排序算法;
import java.util.Arrays;
public class InsertSort {
public static void main(String[] args) {
int[] arr= {4,1,4,5,7,2,2,1,9};
System.out.println("排序前:");
System.out.println(Arrays.toString(arr));
sort(arr);
System.out.println("排序后:");
System.out.println(Arrays.toString(arr));
}
private static void sort(int[] arr) {
for(int i=1;i<arr.length;i++) {
int insertVal=arr[i];
int insertIndex=i-1;
while(insertIndex>=00&&insertVal<arr[insertIndex]) {
arr[insertIndex+1]=arr[insertIndex];
insertIndex--;
}
arr[insertIndex+1]=insertVal;
}
}
}