习题7-1 选择法排序

#include<stdio.h>

int main(void)
{
    int n;
    int number[10];

    scanf_s("%d", &n);

    for (int i = 0; i < n; i++)
    {
        scanf_s("%d", &number[i]);
    }

    for (int i = 0; i < n - 1; i++)
    {
        int index = i;
        for (int j = i + 1; j < n; j++)
        {
            if (number[j] > number[index])
            {
                index = j;
            }
        }
        if (i != index)
        {
            int temp;
            temp = number[i];
            number[i] = number[index];
            number[index] = temp;
        }
    }
    for (int i = 0; i < n; i++)
    {
        if (i == 0)
        {
            printf("%d", number[i]);
        }
        else
        {
            printf(" %d", number[i]);
        }
    }

    printf("\n");

    return 0;
}