From e62501e3f6cd8f9640e20d300f5258c8b636d815 Mon Sep 17 00:00:00 2001
From: LittleBear_Zou <2895083202@qq.com>
Date: Thu, 22 Sep 2022 13:34:04 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=8E=92=E5=BA=8F?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 codes/9727876.java | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 codes/9727876.java

diff --git a/codes/9727876.java b/codes/9727876.java
new file mode 100644
index 00000000..b4c33ab0
--- /dev/null
+++ b/codes/9727876.java
@@ -0,0 +1,28 @@
+/**
+ * 冒泡排序函数
+ * aa bb cc
+ * @param a 待排序的数组
+ * @param n 待排序的数组长度
+ */
+public static void bubbleSort(int [] a, int n){
+    int j , k;
+    int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界
+
+    while (flag > 0){//排序未结束标志
+        k = flag; //k 来记录遍历的尾边界
+        flag = 0;
+
+        for(j=1; j<k; j++){
+            if(a[j-1] > a[j]){//前面的数字大于后面的数字就交换
+                //交换a[j-1]和a[j]
+                int temp;
+                temp = a[j-1];
+                a[j-1] = a[j];
+                a[j]=temp;
+
+                //表示交换过数据;
+                flag = j;//记录最新的尾边界.
+            }
+        }
+    }
+}
-- 
Gitee


From ae5d129d3044137e5e7bb1ff02032e3b492323c3 Mon Sep 17 00:00:00 2001
From: LittleBear_Zou <2895083202@qq.com>
Date: Thu, 22 Sep 2022 13:44:49 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=8E=92=E5=BA=8F?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 codes/{ => workii}/9727876.java | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename codes/{ => workii}/9727876.java (100%)

diff --git a/codes/9727876.java b/codes/workii/9727876.java
similarity index 100%
rename from codes/9727876.java
rename to codes/workii/9727876.java
-- 
Gitee