排序之冒泡排序

#include <stdio.h>
#define OK 1
int BubbleSort(int *a,int length);
int main()
{
    int a[9] = {5,8,7,36,54,21,2,3,19};
    BubbleSort(a,9);
    for(int i = 0;i < 9;i++)
    {
        printf("%d ",a[i]);
    }
    printf("\n");
    return 0;
}

int BubbleSort(int *a,int length)
{
    int temp;
    for(int i = 1;i < length;++i)
    {
        for(int j = 0;j < length-i;++j)
        {
            if(a[j] > a[j+1]) 
            {
                temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
            }
        }
    }
    return OK;
}