插入排序

#include<stdio.h>
int main()
{
    int n;
    scanf_s("%d\n", &n);
    int arr [20] ;
    int i, j;
    for (i = 0; i < n; i++)
    {
        scanf_s("%d", &arr[i]);
    }
    for (i = 1; i < n; i++)
    {
        for (j = 0 ; j < n; j++)
        {
            if (arr[j] > arr[i])
            {
                int temp = arr[i];
                for (int k = i; k > j; k--)
                {
                    arr[k] = arr[k - 1];
                }
                arr[j] = temp;
            }
        }
    }
    for (i = 0; i < n; i++)
    {
        printf("%d", arr[i]);
    }
    return 0;
}   
#include<stdio.h>
int main()
{
    int n;
    scanf_s("%d\n", &n);
    int arr [20] ;
    int i, j;
    for (i = 0; i < n; i++)
    {
        scanf_s("%d", &arr[i]);
    }
    for (i = 1; i < n; i++)
    {
        int key = arr[i];
        int j = i - 1;
        while (j >=0  && arr[j] > key)
        {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = key;
    }
    for (i = 0; i < n; i++)
    {
        printf("%d", arr[i]);
    }
    return 0;
}# MarkDown编辑器基本使用说明