冒泡排序

#include <stdio.h>

#define N   10

int main(void)
{
    int i, j, tmp;
    int a[N] = {6,1,3,2,9,7,8,0,4,5};

    for (i = 0; i < N; i++)
        printf("%d\t", a[i]);
    printf("\n");
    //sort
    for (i = 0; i < N-1; i++) {
        for (j = 1; j < N-i; j++) {
            if (a[j-1] > a[j]) {
                tmp = a[j-1];
                a[j-1] = a[j];
                a[j] = tmp;
            } 
        }
    }

    for (i = 0; i < N; i++)
        printf("%d\t", a[i]);
    printf("\n");

    return 0;
}