要么牛逼，要么牛逼

[size=medium][b]快速排序quickSort[/b][/size] [code="java"] public class Test { public static void main(String[] args) { int arr[] = {3, 5, 6, 333, 5, 2, 1111, 1, 2, 3, 4, 5, 6, 7, 8, 8}; ...

public static void heapSort() { int[] arr = {0, 5, 6, 333, 5, 8, 999, 7, 7, 5, 45, 3}; int heapSize = arr.length - 1;//堆的大小， buildHeap(arr, heapSize);//建堆，递归调用maxHeapify System.ou...

public static void bubbleSort() { int[] arr = {0, 5, 6, 333, 5, 8, 999, 7, 7, 5, 45, 3}; for (int i = arr.length - 1; i > 0; i--) { for (int j = arr.length - 1; j > arr.lengt...