m0_46182401的博客

选修课重难点(个人观点)1.快排（递归思想）void quickSort(int *array, int left, int right){ if(left < right) { int pivot = array[left]; int low = left, high = right; while(low < high) { while(array[high] >= pivot && low < high) high--;