排序算法 -选择排序

//选择排序        
void select_sort(int unsort[], int length)
{
    cout<<"选择排序："<<endl;
    for(int i = 0; i < length; i++)
    {
        int temp = unsort[i];
        int index = i;
        for(int j = i+1; j < length; j++)
        {
            if(temp > unsort[j])
            {
                index = j;
            }
        }
        unsort[i] = unsort[index];
        unsort[index] = temp;

        cout<<"第"<<i+1<<"趟:";
        for(int k = 0; k < length; k++)
        {
            cout<<unsort[k]<<" ";
        }
        cout<<endl;
    }
}