什么是冒泡排序法:
https://www.cnblogs.com/bigdata-stone/p/10464243.html
c++代码实现
#include <iostream>
using namespace std;
void mySort(int *array, int len)
{
int i, j, k = 1;
int temp;
for(j = len; j > 1; j--)
{
for(i = 0; i < j-1; i++)
{
if(array[i] > array[i+1])
{
temp = array[i];
array[i] = array[i+1];
array[i+1] = temp;
}
}
/* 打印每次排序后的结果 */
cout << "times: " << k++ << endl;
for(int count = 0; count < len; count++)
{
cout << array[count] << " ";
}
cout << endl;
}
}
int main()
{
int myArray[] = {9,1,2,5,7,4,8,6,3,5,2};
int len;
len = sizeof(myArray)/sizeof(myArray[0]); //计算数组长度
cout <