TINA_DD的博客

多种排序算法 快排 //快排 void quickSort(int *array,int left,int right) { if (left < right) { int pivot = array[left]; int low = left, high = right; while (low < high) { while (low < high && array[high] > pivot) { --high; }