数组中最小的k个数

//Find The least K-num in the arrayvoid TheLeastKnum(int num[], int first, int end, int k){int index,i;index = partition(num, first, end);while (k != index){if (index < k){first = index + 1;index = partition(num, first, end);}else{end = index - 1;index = partition(num, first, end);}}for (i = 0; i < index; i++){cout << num[i] << " ";}cout << endl;}