PTA 7-7 冒泡法排序

 

#include<stdio.h>
int main()
{
    int N, K;
    scanf("%d %d", &N, &K);
    int arr[1000];
    for (int r = 0; r < N; r++)
    {
        scanf("%d", &arr[r]);
    }
    int t;
    for (int i = 0; i < K; i++)
    {
        for (int j = 0; j < N - 1-i; j++)
        {
            if (arr[j] > arr[j + 1])
            {
                t = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = t;
            }
        }
    }
    for (int m = 0; m < N; m++)
    {
        printf("%d", arr[m]);
        if (m == N - 1)
            break;
        printf(" ");
    }
    return 0;

}