hehe/homework
1
0
Fork 0
forked from newde/homework
Code Pull Requests Activity

更新 260202/冒泡排序.cpp

Browse Source
This commit is contained in:
newde
2026-02-02 11:13:47 -05:00
parent 9bc55aea98
commit e00132b0d1
1 changed files with 27 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
260202/冒泡排序.cpp
View File

@@ -2,23 +2,23 @@
using namespace std; using namespace std;
int main() { int main() {
int a[5] = {8,114,24,88,5}; // 定义一个简单的数组 int a[5] = {8,114,24,88,5}; // 定义一个简单的数组
int n = 5; int n = 5;
// 冒泡排序核心逻辑 // 冒泡排序核心逻辑
for (int i = 0; i < n - 1; i++) { // 外层循环：控制比较轮数 for (int i = 0; i < n - 1; i++) { // 外层循环：控制比较轮数
for (int j = 0; j < n - 1 - i; j++) { // 内层循环：比较相邻两个数 for (int j = 0; j < n - 1 - i; j++) { // 内层循环：比较相邻两个数
if (a[j] > a[j + 1]) { // 如果前面的比后面的大 if (a[j] > a[j + 1]) { // 如果前面的比后面的大
// 交换位置 // 交换位置
int temp = a[j]; int max = a[j];
a[j] = a[j + 1]; a[j] = a[j + 1];
a[j + 1] = temp; a[j + 1] = max;
} }
} }
} }
// 输出结果 // 输出结果
cout << "排序结果: "; cout << "排序结果: ";
for (int i = 0; i < n; i++) { for (int i = 0; i < n; i++) {
cout << a[i] << " "; cout << a[i] << " ";
} }