From d5a7296fa4f84d91c145531ab0b803898288d36a Mon Sep 17 00:00:00 2001
From: pn43tqvrm <2516333959@qq.com>
Date: Sat, 19 Feb 2022 16:06:46 +0800
Subject: [PATCH] =?UTF-8?q?Add=20=E5=86=92=E6=B3=A1=E6=8E=92=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 冒泡排序 | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 冒泡排序

diff --git a/冒泡排序 b/冒泡排序
new file mode 100644
index 0000000..be715f8
--- /dev/null
+++ b/冒泡排序
@@ -0,0 +1,18 @@
+//冒泡排序 
+void Sort(int a[], int n)
+{
+    int i, j, t;
+    for(i = 0; i < n - 1; i ++)//控制循环次数 
+    {
+        for(j = 0; j < n - 1 - i; j ++)//通过遍历与交换依次将较大的数放在数组后边 
+        {
+            if(a[j] > a[j+1])////a[j] > a[j + 1]是升序， a[j] < a[j + 1]是降序 
+            { 
+                t = a[j];
+                a[j] = a[j+1];
+                a[j+1] = t;
+            }
+        }
+    }
+}
+//复杂度说明：基本操作为交换操作，当数组按从小到大有序排列时，基本操作执行次数为0，从大到小有序排列时，基本操作执行次数为 [n(n-1)/2]，所以时间复杂度为O(n^2)