比量现行之茎

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

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

void insertSort(int n, int a[])
{
    int i, j;
    for (i = 0; i < n-1; i++)
    {
        int temp=a[i], idx=i;
        for (j = i; j < n; j++)
        {
            if(temp > a[j]){
                temp = a[j];
                idx = j;
            }
        }
        a[idx] = a[i];
        a[i] = temp;
        for (int k = 0; k < n; k++)
        {
            printf("%d,", a[k]);
        }
        printf("\n");
    }
}

GitHub: Let’s build from here · GitHubGitHub is where over 100 million developers shape the future of software, together. Contribute to the open source community, manage your Git repositories, review code like a pro, track bugs and features, power your CI/CD and DevOps workflows, and secure code before you commit it.https://github.com