a1344552416的博客

1.冒泡排序（优化前+优化后） //优化前 static void bubble(int a[]) { int temp; for (int i = 0; i < a.length - 1; i++) { for (int j = 0; j < a.length - 1 - i; j++) { //第一趟排序 if (a[j] >= a[j + 1]) {

public static void shellSort(int[] arr) { int temp = 0; int count = 0; for (int gap = arr.length / 2; gap > 0; gap /= 2) { for (int i = gap; i < arr.length; i++) { for (int j = i - gap; j &...