冒泡排序（因为过程像冒泡，所以叫做冒泡排序）
流程：
（1）对数组中各个数字，一次比较相邻两个
（2）如果前面大于后面，就交换这两个数据
（3）再用同样的方法继续排，直到外层循环排完
或者
（1）把第一个数与后续依次比较，大的话就交换顺序
（2）直到外层循环排完
本质一样的，下面依次展示两种
#include<iostream>
#include<cstdlib>
#include<ctime>
using namespace std;
void BubbleSort1(int a[],int len)
{
int t;
for (int i = 0; i < len-1; i++)
{
for (int j = len-1; j>i; j--)
{
if (a[j]<a[j-1])
{
t=a[j-1];
a[j-1]=a[j];
a[j]=t;
}
}
cout<<"Sort results in"<<i+1<<" step :";
for (int k = 0; k <len ; k++) cout<<a[k]<<" ";
cout<<endl;
}
}
void BubbleSort2(int *a,int len)
{
int t;
for (int i = 0; i < len-1; i++)
{
for (int j = i; j<len; j++)
{
if (a[j]<a[i])
{
t=a[j];
a[j]=a[i];
a[i]=t;
}
}
cout<<"Sort results in"<<i+1<<" step :";
for (int k = 0; k <len ; k++) cout<<a[k]<<" ";
cout<<endl;
}
}
int main()
{
int array1[10],array2[10];
srand(time(NULL)); //这里采用随机数输入，为了让随机数真正的随机，所以就利用系统时间
cout<<"Array1 before sorting:"<<endl;
for (int i = 0; i < 10; i++)
{
array1[i]=rand()/1000;
cout<<array1[i]<<" ";
}
cout<<"Array2 before sorting:"<<endl;
for (int i = 0; i < 10; i++)
{
array2[i]=rand()/1000;
cout<<array2[i]<<" ";
}
cout<<endl;
BubbleSort1(array1,10);
cout<<"Array1 after sorting:"<<endl;
for (int i = 0; i < 10; i++) cout<<array1[i]<<" ";
cout<<endl;
BubbleSort2(array2,10);
cout<<"Array2 after sorting:"<<endl;
for (int i = 0; i < 10; i++) cout<<array2[i]<<" ";
cout<<endl;
return 0;
}