补充完成快速排序 int divide( int a[], int low, int high) { int k = a[low]; do { while (low
=k) --high; if (low < high) { a[low] =_____ (1)___ ;} while (low < high && a[low] <=k) _____ (2)___; if (low < high) {a[high] =_____ (3)__; } } while (low != high); a[low] = k; return low; } void quicksort(int a[], int low, int high) { int mid; if (low >= high) return; //待分段的元素只有一个或0个,排序结束 _____ (4)__ = divide(a, low, high); //low作为基准元素,划分数组,返回中间元素的下标 quicksort( a, low, mid-1); //排序左一半 quicksort( a, mid+1, high); //排序右一半 }