算法时间:O(n^2)
实现:
public int[] insertSort(int[] arr) {
if (arr.length < 2) {
return arr;
}
for (int i = 1; i < arr.length; i++ ) {
int key = arr[i];
int j = i-1;
while(j >= 0 && arr[j] > key) {
arr[j+1] = arr[j];
j--;
}
arr[j+1] = key;
}
return arr;
}