【基础排序】冒泡排序

#include <iostream>
using namespace std;

void BubbleSort(int a[],int n)
{
	int i;
	bool change = true;
	while(change)
	{
		change = false;
		for(i=0; i<n-1 ; i++)
		{
			if(a[i]>a[i+1])
			{
				change = true;
				swap(a[i],a[i+1]);
			}
		}
	}
}

void print(int a[],int n)    
{    
    for(int i=0; i<n; i++)    
    {    
        cout<<a[i]<<" ";    
    }    
    cout << endl;    
}    
  
  
void main()    
{    
    int a[] = {1,3,6,8,0,5,7};    
    cout << "排序前：";    
    print(a,sizeof(a)/sizeof(a[0]));  
	int n=sizeof(a)/sizeof(a[0]);  
    BubbleSort(a,n);    
    cout << "排序后：";    
    print(a,sizeof(a)/sizeof(a[0]));    
}