排序算法之插入排序-java版

/**
 * @author shengjk1
 * @date 2020/4/9
 */
public class InsertSort {
	public static void main(String[] args) {
		int[] arr = new int[8];
		for (int i = 0; i < 8; i++) {
			arr[i] = (int) (Math.random() * 80000000);
		}

		for (int i = 1; i < arr.length; i++) {
			int insertIndex = i;
			int insertValue = arr[insertIndex];
			
			//找到相应的位置
			while (insertIndex - 1 >= 0 && arr[insertIndex - 1] > insertValue) {
				arr[insertIndex] = arr[insertIndex - 1];
				insertIndex--;
			}
			//并将其按照插入有序列表中
			arr[insertIndex] = insertValue;
			System.out.printf("第%d次遍历 insertIndex %d arr:%s", i, insertIndex, Arrays.toString(arr));
			System.out.println();
		}
	}
}