冒泡法排序

#include <stdio.h>

int main()
{
    int a[5] = {3, 5, 2, 1, 4};
    int i, j, tmp;
    int len = (int)(sizeof(a) / sizeof(a[0]));
    //从小到大排序
    for (i = 0; i < len - 1; i++) {
        for (j = 0; j < len - 1 - i; j++) {
            if (a[j] > a[j + 1]) {
                atmp = a[j + 1];
                a[j + 1] = a[j];
                a[j] = tmp;
            }
        }
    }
    printf("a [");
    for (i = 0; i < len - 1; i++) {
        printf("%d, ", a[i]);
    }
    printf("%d]\n", a[i]);

    return 0;
}