Topk找出最大的K个数

使用了快速排序中的思想，期望时间复杂度为O（N）。

#include <iostream>
using namespace std;

void select(int* array, int k, int low, int high)
{
	int i = low, j = high;
	int temp = array[i];
	while (i < j)
	{
		while (array[j] > temp && i < j)
		{
			j--;
		}
		array[i] = array[j];
		while (array[i] < temp && i < j)
		{
			i++;
		}
		array[j] = array[i];
	}
	array[j] = temp;
	int len = high - j + 1;
	if (len == k)
	{
		for (int k = j; k != high; k++)
		{
			cout<<array[k]<<" ";
		}
		cout<<endl;
	}
	else if (len-1 == k)
	{
		for (int l = j+1; l != high; l++)
		{
			cout<<array[l]<<" ";
		}
		cout<<endl;
	}
	else if (len-1 > k)
	{
		select(array, k, j+1, high);
	}
	else 
	{
		select(array, k-len, low, j-1);
		for (int l = j+1; l != high; l++)
		{
			cout<<array[l]<<" ";
		}
		cout<<endl;
	}
}

int main()
{
	int array[] = {4, 5, 1, 3, 5, 6, 7, 2};
	int k = 5;
	select(array,k,0,8);
}