7大排序算法之——选择排序

//选择排序
void select_sort(int* a, int n)
{
    int min;
    int i, j;
    for (i = 0; i < n; i++)
    {
        min = i;
        for (j = i + 1; j < n; j++)
        {
            if (a[j] < a[min])
                min = j;
        }
        if (min != i)
        {
            swap(a, i, min);
        }
    }
}

int main()
{
    int arr[] = { 4, 6, 5, 8, 9, 3, 2, 1, 7 };
    int size = sizeof(arr) / sizeof(int);
    select_sort(arr, size);
    for (int i = 0; i < size; i++)
    {
        cout << arr[i] << " ";
    }
    cout << endl;
    return 0;
}