OJ6-2 B. selection sort

B. selection sort

#include <stdio.h>
#include <stdlib.h>
void selectionSort(int a[], int n);

int main()
{
    int n;
    scanf("%d", &n);
    int a[n];
    for (int i = 0; i < n; i++)
    {
        scanf("%d,", &a[i]);
    }
    selectionSort(a, n);

    return 0;
}
void selectionSort(int a[], int n)
{
    int minIndex;
    int i, j;
    int temp;
    for (i = 0; i < n - 1; i++) //注意此处一定是n-1
    {
        minIndex = i;
        for (j = i + 1; j < n; j++)
        {
            if (a[j] < a[minIndex])
            {
                minIndex = j;
            }
        }

        //交换以minIndex 和i为下标的两个元素
        temp = a[minIndex];
        a[minIndex] = a[i];
        a[i] = temp;

        for (int k = 0; k < n; k++)
        {
            printf("%d,", a[k]);
        }
        printf("\n");
    }
}