寻找最小的K个数

解法一：排序法：

//解法一：全部排序
//时间复杂度：O(n*n);
#include <iostream>
using namespace std;

template<class T>
void Sort(T array[], size_t size, int k)
{
    for (int i = 0; i < size; i++)  
    {  
        for (int j = i + 1; j < size; j++)  
        {  
            if (array[i] > array[j])  
            {  
                swap(array[i], array[j]);  
            }  
        }  
    } 

    for(int idx=0; idx<k; idx++)
        cout<<array[idx];
    cout<<endl;
}

void FunTest()
{
    int arr[] = {
  1, 11, 12, 13, 14, 15, 16, 17, 18, 19,
        20,  2,  3,  4,  5,  6,  7,  8,  9, 10,
        71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
        21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
        31, 32, 33, 34, 35,