起泡排序_复习

// 相邻两记录比较，逐个移动

void bubble_sort( char* x, int n )
{
    int i, j, t;

     for ( i = 0; i < n; i++ )
         for ( j = 0; j < n-i-1; j++ )
             if ( x[j] > x[j+1] )
             {
                t = x[j];
                 x[j] = x[j+1];
                 x[j+1] = t;
             }
}