Problem H: 插入排序和冒泡排序实验

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#define C 100
void bubble_sort(int n, int a[n]);
int main()
{
    int n;
    scanf("%d", &n);
    int a[n];
    for(int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    bobble_sort(n, a);
 
    for(int i = 0; i < n; i++)
    {
        if(i == 0)
            printf("%d", a[0]);
        else
            printf(" %d", a[i]);
    }
    return 0;
}
 
void bobble_sort(int n, int a[n])
{
    int flag = 0;
    for(int j = 1; j < n; j++)
    {
        if(flag == 1)
            return;
        flag = 1;
        for(int i = 0; i < n - j; i++)
        {
            if(a[i] > a[i + 1])
            {
                int b;
                b = a[i];
                a[i] = a[i + 1];
                a[i + 1] = b;