Last updated 5 years ago
Was this helpful?
@See @See - InsertSort
从列表第一位开始向高位进行排序 每次取一位向下沉底排序 双for循环推进排序
@Override public void sort(int[] list) { if (list != null && list.length > 1) { for (int i = 1; i < list.length; i++) { for (int j = i; j > 0; j--) { if (list[j] < list[j - 1]) { swap(list, j, j - 1); } else { break; } } } } }