选择排序selection

#include <iostream>

using namespace std;

int main()
{
    int arr[] = {2, 3, 5, 2, 10, 1, 4};
    int n = sizeof(arr) / sizeof(*arr);

    int i=0, j=0, minimum, temp;

    for(i=0; i<n; i++)
    {
        minimum = i;
        for(j=i; j<n; j++)
        {
            if(arr[minimum] > arr[j])
            {
                minimum = j;
            }
        }
        temp = arr[minimum];
        arr[minimum] = arr[i];
        arr[i] = temp ;

    }

    for(i=0; i<n; i++)
    {
        cout << arr[i] << " ";
    }

    return 0;
}