快排優化代碼__2018.07.26

代碼：優化 ======四、快速排序優化============== int Partion(int *arr,int low,int high) { int tmp = arr[low]; while(low < high) { while(low < high && arr[high] >= tmp) { high--; } if(low >= high) {

>>阅读原文<<