cai649399010的专栏

#include #include void swap(int* data, int i, int j){ int temp; temp = data[i]; data[i] = data[j]; data[j] = temp; } void simpleSelectSort(int* data, int n){ int min; //外层循环用来控制每一趟最值的存储位置，当数组下标为

void  quickSort(int * data, int low, int high) { int pivot;         if(low //1.low == high 可以理解为数组只有一个元素。2.当前趟要确定最终位置的数的最终位置在：low == high处。3.low { pivot = partition(data, low, high);

#include #include void  swap(int* data, int i, int j) {     int temp = data[i];     data[i] = data[j];     data[j] = temp; } /*低效的冒泡排序*/ void ineff_bubbleSort(int* data, int  n) {     for(

#include #include void swap(int* data, int i, int j){ int temp; temp = data[i]; data[i] = data[j]; data[j] = temp; } //优美的递归实现堆调整  void adjustBigTopHeap(int* data, int root, int n){ int left