From 770e3ca4ce052cba5936a9a0874cc2b64a1876e4 Mon Sep 17 00:00:00 2001
From: L-Super <40905056+L-Super@users.noreply.github.com>
Date: Mon, 26 Dec 2022 10:17:35 +0800
Subject: [PATCH] Update bubble_sort.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

C++使用std::swap()交换数组，同时添加C语言代码，作为原始C++代码的补充
---
 docs/chapter_sorting/bubble_sort.md | 49 ++++++++++++++++++++++++-----
 1 file changed, 41 insertions(+), 8 deletions(-)

diff --git a/docs/chapter_sorting/bubble_sort.md b/docs/chapter_sorting/bubble_sort.md
index f44b11924..522f17af5 100644
--- a/docs/chapter_sorting/bubble_sort.md
+++ b/docs/chapter_sorting/bubble_sort.md
@@ -85,9 +85,7 @@ comments: true
             for (int j = 0; j < i; j++) {
                 if (nums[j] > nums[j + 1]) {
                     // 交换 nums[j] 与 nums[j + 1]
-                    int tmp = nums[j];
-                    nums[j] = nums[j + 1];
-                    nums[j + 1] = tmp;
+                    std::swap(nums[j], nums[j+1]);
                 }
             }
         }
@@ -170,7 +168,24 @@ comments: true
 === "C"
 
     ```c title="bubble_sort.c"
-
+    /* 冒泡排序 */
+    void bubble_sort(int nums[], int size)
+    {
+        // 外循环：待排序元素数量为 n-1, n-2, ..., 1
+        for (int i = 0; i < size - 1; i++)
+        {
+            // 内循环：冒泡操作
+            for (int j = 0; j < size - 1 - i; j++)
+            {
+                if (nums[j] > nums[j + 1])
+                {
+                    int temp = nums[j];
+                    nums[j] = nums[j + 1];
+                    nums[j + 1] = temp;
+                }
+            }
+        }
+    }
     ```
 
 === "C#"
@@ -250,9 +265,7 @@ comments: true
             for (int j = 0; j < i; j++) {
                 if (nums[j] > nums[j + 1]) {
                     // 交换 nums[j] 与 nums[j + 1]
-                    int tmp = nums[j];
-                    nums[j] = nums[j + 1];
-                    nums[j + 1] = tmp;
+                    std::swap(nums[j], nums[j+1]);
                     flag = true;  // 记录交换元素
                 }
             }
@@ -352,7 +365,27 @@ comments: true
 === "C"
 
     ```c title="bubble_sort.c"
-
+    /* 冒泡排序 */
+    void bubble_sort(int nums[], int size)
+    {
+        // 外循环：待排序元素数量为 n-1, n-2, ..., 1
+        for (int i = 0; i < size - 1; i++)
+        {
+            bool flag = false;
+            // 内循环：冒泡操作
+            for (int j = 0; j < size - 1 - i; j++)
+            {
+                if (nums[j] > nums[j + 1])
+                {
+                    int temp = nums[j];
+                    nums[j] = nums[j + 1];
+                    nums[j + 1] = temp;
+                    flag = true;
+                }
+            }
+            if(!falg) break;
+        }
+    }
     ```
 
 === "C#"