xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 00:16:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix(codes/c): Fix bubble_sort.c (#983)

Browse source
This commit is contained in:
gonglja 2023-12-11 00:42:45 +08:00 committed by GitHub
parent 2e130d4bbc
commit d67c458caa
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -9,7 +9,7 @@
/* 冒泡排序 */ /* 冒泡排序 */
void bubbleSort(int nums[], int size) { void bubbleSort(int nums[], int size) {
// 外循环：未排序区间为 [0, i] // 外循环：未排序区间为 [0, i]
for (int i = 0; i < size - 1; 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 < size - 1 - i; j++) {
if (nums[j] > nums[j + 1]) { if (nums[j] > nums[j + 1]) {
@ -24,7 +24,7 @@ void bubbleSort(int nums[], int size) {
/* 冒泡排序（标志优化）*/ /* 冒泡排序（标志优化）*/
void bubbleSortWithFlag(int nums[], int size) { void bubbleSortWithFlag(int nums[], int size) {
// 外循环：未排序区间为 [0, i] // 外循环：未排序区间为 [0, i]
for (int i = 0; i < size - 1; 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 < size - 1 - i; j++) {