算法---冒泡法--改进型

void bubblesort(int a[],int n)
{
        int i,j,t,flag;
        flag = 1;
        for(i=0;i<n && flag;i++)
        {
                flag = 0;
                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;
                                flag = 1;
                        }
                }
        printf("is %d times:",i+1);
        for(j=0;j<n;j++)
        printf("%d ",a[j]);
        printf("\n");
        }

}