冒泡排序
#include<iostream>
using namespace std;
int main()
{
//冒泡排序
int arr[9] = { 2,4,7,5,3,6,9,0,1 };
for (int i = 0; i < 8; i++)//总排序数
{
for (int j = 0; j < 8 - i; j++)//对比次数
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int a = 0; a < 9; a++)
{
cout << arr[a];
}
cout << endl; system("pause");
return 0;
}
如有错误,请指正,谢谢!