c语言----- 冒泡排序 for while do-while 递归练习

            for(int i = 0;i < N-1;i++){

　　for(int j = 0;j < N-1-i;i++){
          交换 ...
    }
}
    

#include<stdio.h>
#include<stdlib.h>
#define N 10
void print(int *a){
    for (int i = 0; i < N; i++)
    {
        printf("%d ",*(a+i));
    }
    printf("\n");
}
void maopao_for(int *a){
    for (int i = 0; i < N - 1; i++) {
        for (int j = 0; j < N - 1 - i; j++) {
            if (a[j] > a[j + 1]) {
                int temp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = temp;
            }
        }
        print(a);
    }
}
void maopao_while(int *a) {
    int i = 0;
    while (i < N - 1)
    {
        int j = 0;
        while (j < N - 1 - i)
        {
            if (a[j] > a[j + 1]) {
                int temp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = temp;
            }
            j++;
        }
        print(a);
        i++;
    }
}
void maopao_do_while(int *a) {
    int i = 0;
    do{
        int j = 0;
        do{
            if (a[j] > a[j + 1]) {
                int temp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = temp;
            }
            j++;
        } while (j < N - 1 - i);
        print(a);
        i++;
    } while (i < N - 1);
}
// 递归可以减少一次循环
void maopao_digui(int *a,int count) {
    if(count>=N) return ;
    for (int j = 0; j < N - 1 - count; j++) {
        if (a[j] > a[j + 1]) {
            int temp = a[j];
            a[j] = a[j + 1];
            a[j + 1] = temp;
        }
    }//printf("下一次交换\n\n\n");        print(a);
    maopao_digui(a,count+1);
}
int main(){
    int a[N] = {5,8,2,1,6,9,4,3,7,0};
    printf("排序前：\n");
    print(a);
    printf("排序中：\n");
    maopao_digui(a,0);
    printf("排序后：\n");
    print(a);
    return0;
}