快速排序的partition版本实现
摘要:int partition(int arr[], int low, int high) { int pivot = arr[high]; int i = low-1; for (int j = low; j < high; j++) { i...
阅读全文
posted @ 2015-07-26 14:33
我不是在说教只是在学习,要是能帮到你我会更高兴。
posted @ 2015-07-26 14:33
posted @ 2015-07-23 10:33