代码实现
package com.wllarl.suanfa.sort; import java.util.Arrays; public class InsertSort { public static void main(String[] args) { int []arr = {12,134,222,-1,45}; InsertSort insertSort = new InsertSort(); insertSort.insertSort(arr); System.out.println(Arrays.toString(arr)); } public void insertSort(int[] arr){ for (int i=1; i < arr.length; i++){ int indexVaule = arr[i];//存取元素的值 int insertIndex = i - 1;//插入元素索引 while (insertIndex >=0 && indexVaule < arr[insertIndex]){ arr[insertIndex+1] = arr[insertIndex];//大的元素向后移动 insertIndex--; } arr[insertIndex+1] = indexVaule; } } }实验截图： [-1, 12, 45, 134, 222]
