算法---冒泡法

冒泡排序法是一种相邻数据交换的排序方法

void bubblesort(int a[],int n)
{
        int i,j,t;
        for(i=0;i<n;i++)
        {
                for(j=n-1;j>i;j--)
                {
                        if(a[j-1] > a[j])
                        {
                                t = a[j-1];
                                a[j-1] = a[j];
                                a[j] = t;
                        }
                }
        }
}