设计算法实现在一个具有在n各互不相同元素的数组A[1…n]中找出所有前k个最小元素的问题，这里k不是常量，即它是输入数据的一部分。要求算法的时间复杂性为Θ(n)。-design of the algorithm is in a n incompatible with the elements of the array A [1 ... n] to identify all former k smallest elements of the problem, here k is not constant, that it is part of the input data. Asked algorithm's time complexity of Theta (n).