algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 14:18:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix bubble_sort.c

Browse Source
This commit is contained in:
krahets
2023-12-18 22:52:00 +08:00
parent d0f4fa69a6
commit d9686e57dd
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/c/chapter_sorting/bubble_sort.c
View File

@ -11,7 +11,7 @@ void bubbleSort(int nums[], int size) {
// 外循环：未排序区间为 [0, i] // 外循环：未排序区间为 [0, i]
for (int i = size - 1; i > 0; i--) { for (int i = size - 1; i > 0; i--) {
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端 // 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
for (int j = 0; j < size - 1 - i; j++) { for (int j = 0; j < i; j++) {
if (nums[j] > nums[j + 1]) { if (nums[j] > nums[j + 1]) {
int temp = nums[j]; int temp = nums[j];
nums[j] = nums[j + 1]; nums[j] = nums[j + 1];
@ -27,7 +27,7 @@ void bubbleSortWithFlag(int nums[], int size) {
for (int i = size - 1; i > 0; i--) { for (int i = size - 1; i > 0; i--) {
bool flag = false; bool flag = false;
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端 // 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
for (int j = 0; j < size - 1 - i; j++) { for (int j = 0; j < i; j++) {
if (nums[j] > nums[j + 1]) { if (nums[j] > nums[j + 1]) {
int temp = nums[j]; int temp = nums[j];
nums[j] = nums[j + 1]; nums[j] = nums[j + 1];