最小的k个数

int Patition(int data[],int length,int start,int end)
{
if(data == NULL|| length<=0 || start<0 || end>=length)
throw new exception(“invalid parameters”);
int index = start;
swap(data[index],data[end]);

int small = start - 1;
for(index=start;index<end;++index)
{
    if(data[index]<data[end])
    {
        ++small;
        if(small != index)
            swap(data[small],data[index]);
    }
}
++small;
swap(data[small],data[end]);

return small;

}
void GetLeastNumbers(int* input,int n,int* output,int k)
{
if(input == NULL||output == NULL||n <= 0||k <= 0||k > n)
return;
int start = 0;
int end = n-1;
int index = Patition(input,n,start,end);
while(index != k-1)
{
if(index > k-1)
{
end = index - 1;
index = Patition(input,n,start,end);
}
else
{
start = index + 1;
index = Patition(input,n,start,end);
}
}

for(int i=0;i<k;++i)
{
    output[i] = input[i];
}

}