冒泡排序

/*
bubble.c
write by Zoro
date: 2019/11/7
function: 冒泡排序
*/
#include <stdio.h>

void bubble(int arr[], int n) {
    int i;
    int tmp;
    for (i = 0; i < n - 1; i++) {
        if (arr[i] > arr[i+1]) {
            tmp = arr[i];
            arr[i] = arr[i+1];
            arr[i+1] = tmp;
        }
    }
}

void bubbleSort(int arr[], int n) {
    int i;
    for (i = n; i >= 1; i--) {
        bubble(arr, i);
    }
}

int main(void) {
    int arr[] ={6, 5, 1, 2, 3, 9, 8, 4, 7};
    int i;
    bubbleSort(arr, 9);
    for (i = 0; i < 9; i++) {
        printf("%d\n", arr[i]);
    }
    return 0;
}

冒泡排序

原文：https://www.cnblogs.com/xuzhaoping/p/11816968.html