气泡法.txt

资深C++讲师授课代码

inline void swap(int& x, int& y)
{
        int t=x;
        x = y;
        y = t;
}
void sort(int* a, int n)
{
        bool swapped;
        do{
                swapped = false;
                for(int i=0; i<n-1; i++){
                        if(a[i+1]<a[i]){
                                swap(a[i+1], a[i]);
                                swapped = true;
                        }
                }
                --n;
        }while(swapped);
}