#include <iostream>
using namespace std;
void busort(int *a, int n)
{
int i,j,temp;
for (i = 0;i < n - 1;i++)
for (j = i + 1;j < n;j++)
if (a[i] > a[j])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
int main()
{
int a[] = { 35,89,61,135,78,29,50,13 };
int len = sizeof(a) / sizeof(a[0]);
busort(a, len);
for (int i = 0;i < len;i++)
cout << a[i] << endl;
system("pause");
return 0;
}
uj5u.com熱心網友回復：
希望對您有幫助，盼采納：https://blog.csdn.net/it_xiangqiang/category_10768339.htmluj5u.com熱心網友回復：
冒泡排序
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/283774.html
標籤：C++ 語言
上一篇：求解大哥們