N个数中第k大的元素

// 3 implement the function : int part(int *a,int low,int high), and implement the function to find the k-st num in a array a[low] as the pivot element int part(int *a,int low,int high){ int temp

>>阅读原文<<