冒泡排序

#include <stdio.h>

void maoPao(int arr[], int len){
    int temp;
    for (int i = 0; i < len - 1; i++) {
        for (int j = 0; j < len - 1 - i; j++) {
            if (arr[j] > arr[j + 1]) {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

int main(int argc, const char * argv[]) {
    
    int a[7] = {9,6,4,3,0,1,5};
    // 排序前
    for (int i  = 0; i < 7; i++) {
        printf("%d	", a[i]);
    }
    printf("
");
    maoPao(a, 7);
    // 排序后
    for (int i  = 0; i < 7; i++) {
        printf("%d	", a[i]);
    }
    printf("
");
    return 0;
}

效果图: