selectsort1.txt

selection排序法

//**************************************
//     
// Name: Select Sort
// Description:This will sort an array o
//     f integers using the select sort algorit
//     hm.
// By: MaLord
//
// Inputs:An array of integers and the n
//     umber of items in the array.
//

void select_sort(int array[], int size)


    {
    //Go through the array comparing every n
    //     umber
    //with every number after it, 
    //if the first number is bigger then swa
    //     p the data
    for (int i = 0; i < size-1)


        {
        for (int compare = i+1; compare < size; compare++)


            {
            if (array[i] > compare[i])
            swap(array[i], compare[i]);
        }
    }
}
void swap(int &first, int &second)


    {
    //For a swap, a temporary variable must 
    //     be used
    int temp = first;
    first = second;
    second = temp;
}