java排序算法快速、冒泡、插入、选择.docxVIP

测试入口完整代码：publicclass Sort {// 冒泡排序算法publicstaticvoid bubbleSort(int[] a) {inti, j, temp = 0;for (j = a.length; j 1; j--) {for (i = 0; i j - 1; i++) {if (a[i] a[i + 1]) {temp = a[i];a[i] = a[i + 1];a[i + 1] = temp;}}}}// 插入排序算法publicstaticvoid insertSort(int[] a) {inti, j, InsertNode;for (i = 1; i a.length; i++) {InsertNode = a[i];j = i - 1;while (j = 0 InsertNode a[j]) {a[j + 1] = a[j];j--;}a[j + 1] = InsertNode;}}// 快速排序算法publicstaticvoid quickSort(int[] a) {sort(0, a.length - 1, a.length, a);}privatestaticvoid sort(intleft, intright, intlength, inta[]) {inti, j, pivot;if (left = right)return;i = left;j = right;pivot = a[left];while (i j) {while (a[j] = pivot i j)j--;if (i j) {a[i] = a[j];i++;}while (a[i] = pivot i j)i++;if (i j) {a[j] = a[i];j--;}}a[i] = pivot;sort(left, j - 1, length, a);sort(i + 1, right, length, a);}// 选择排序算法publicstaticvoid selectSort(int[] a) {inti, j, min_index, temp;for (i = 0; i a.length - 1; i++) {min_index = i;for (j = i + 1; j a.length; j++) {if (a[j] a[min_index])min_index = j;}if (i != min_index) {temp = a[i];a[i] = a[min_index];a[min_index] = temp;}}}// 整数数组的打印publicstaticvoid printIntArry(int[] a) {for (inti = 0; i a.length; i++) {System.out.print(a[i] + 　　);if ((i + 1) % 7 == 0)System.out.println();}}publicstaticvoid main(String[] args) {inta[] = { 8, 5, 3, 7, 2, 9, 4, 0, 5, 8, 33, 2, 7, 8, 44, 33, 21, 27, 85, 54, 4, 44 };// Sort.bubbleSort(a);// Sort.insertSort(a);// Sort.quickSort(a);// Sort.selectSort(a);Sort.printIntArry(a);}}