改进型冒泡排序

void bubble(int a[],int n)
{
    int i,j,flag;
    int temp;
    for(i = 0; i < n - 1; i++)
    {
        flag = 0;
        for(j = 0; j < n-i-1; j++)
            if(a[j] > a[j+1]
            {
                flag = 1;
                temp = a[j];
                a[j] = a[j+1];       
                a[j+1] = temp;
            }
        if(flag == 0)
            break;               
    }
}