确定S中最接近中位数的k个元素
（算法导论第三版9.3-7题）
时间复杂度O(n)
vector<int> k_elements_closest_to_median(int *array,int start,int end,int k)
{vector<int> result;int median = select(array,start,end,(end - start + 1)/2 + (end - start + 1) % 2);int *array_temp = new int [end - start + 1];int absolute_value;for (int i = start; i < end + 1; ++i) {absolute_value = array[i] - median;;array_temp[i-start] = absolute_value >= 0 ? absolute_value: -absolute_value;}int k_smallest = select(array_temp,0,end - start,k);for (int i = start; i < end + 1; ++i) {absolute_value = array[i] - median;absolute_value = absolute_value >= 0 ? absolute_value: -absolute_value;if(absolute_value <= k_smallest)result.push_back(array[i]);}delete[] array_temp;return result;
}
辅助函数select
链接地址
)
)
)
)