#include<iostream>
using namespace std;
int main() {
int arr[] = { 10,45,2,65,5,8,4,82,11,51 };
int num = sizeof(arr) / sizeof(arr[0]);
cout << "排序前" << endl;
for (int i = 0; i < num; i++) {
cout << arr[i]<<" ";
}
cout << endl;
for (int i = 0; i < num-1; i++) {
for (int j = 0; j < num - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
cout << "排序后" << endl;
for (int i = 0; i < num; i++) {
cout << arr[i] << " ";
}
cout << endl;
system("pause");
return 0;
}
C++:冒泡排序,代码实现
最新推荐文章于 2024-05-13 02:10:04 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)