交换排序之起泡排序

#include <iostream>

using namespace std;
void bubble_sort(int a[],int n)
{
    int exchange=n;
    while(exchange!=0)
    {
        int i, bound=exchange;
        exchange=0;
        for(i=0;i<bound;i++)
        {
            if(a[i+1]<a[i])
            {
                int temp=a[i];
               a[i]=a[i+1];
               a[i+1]=temp;
                exchange=i;
            }

        }

    }
}
int main()
{
int n=10;
int a[n]={11,9,8,7,6,5,4,3,2,1};
bubble_sort(a,n);
for(int i=0;i<n;i++)
    cout<<a[i]<<" ";
cout<<endl;
return 0;
}

转载于:https://my.oschina.net/u/3510880/blog/914119