算法：冒泡排序

#include<iostream>
#include<cassert>

void bubble_sort(int  *arr,int n);

using name space std;

void bubble_sort(int  *arr,int n)
{
assert(arr);
int  i,j,temp;
for(i = 0; i < n - 1; i ++)
{
int flag = 0;
for(j = 0 ; j < n-1-i ; j++)
{
if(a[j] > a[j +1])
{
temp = a[j];
a[j] =a[j+1];
a[j+1] =temp;
flag = 1;
}
}

if(flag == 0)
return ;
}

}
int main()
{

int arr[7] = { 7,6,5,3,2,1,4};
int i = 0;

for(i = 0; i < 7; i ++)
cout <<a[i] << "  ";

cout << endl;

}