From d67c458caad834ff96718d0dec1475edfa8422de Mon Sep 17 00:00:00 2001
From: gonglja <39959756+Gonglja@users.noreply.github.com>
Date: Mon, 11 Dec 2023 00:42:45 +0800
Subject: [PATCH] fix(codes/c): Fix bubble_sort.c (#983)

---
 codes/c/chapter_sorting/bubble_sort.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/codes/c/chapter_sorting/bubble_sort.c b/codes/c/chapter_sorting/bubble_sort.c
index 6df1d1858..7de9483b7 100644
--- a/codes/c/chapter_sorting/bubble_sort.c
+++ b/codes/c/chapter_sorting/bubble_sort.c
@@ -9,7 +9,7 @@
 /* 冒泡排序 */
 void bubbleSort(int nums[], int size) {
     // 外循环：未排序区间为 [0, i]
-    for (int i = 0; i < size - 1; i++) {
+    for (int i = size - 1; i > 0; i--) {
         // 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
         for (int j = 0; j < size - 1 - i; j++) {
             if (nums[j] > nums[j + 1]) {
@@ -24,7 +24,7 @@ void bubbleSort(int nums[], int size) {
 /* 冒泡排序（标志优化）*/
 void bubbleSortWithFlag(int nums[], int size) {
     // 外循环：未排序区间为 [0, i]
-    for (int i = 0; i < size - 1; i++) {
+    for (int i = size - 1; i > 0; i--) {
         bool flag = false;
         // 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
         for (int j = 0; j < size - 1 - i; j++) {