排序算法总结（七）冒泡排序

#include <iostream>

using namespace std;

void BubbleSort(int *arrays,int n);

void main()
{
int i;
int arrays[]={1,4,5,2,9,0,3};
BubbleSort(arrays,7);
for (i=0;i<7;i++)
{
cout << arrays[i] <<" ";
}
cout << endl;
}

void BubbleSort(int *arrays,int n)
{
int i,j;
int tmp;
int flag;
for (i=0;i<n-1;i++)
{
flag=0;
for (j=0;j<n-i-1;j++)
{
if (arrays[j] > arrays[j+1])
{
tmp=arrays[j];
arrays[j]=arrays[j+1];
arrays[j+1]=tmp;
flag=1;
}
}
if (flag==0)
{
return;   //发现数字有序就不用排了
}
}
}