From 7c8db908e10fae5dc437c4ac75cd32a594e55db6 Mon Sep 17 00:00:00 2001
From: yuancr <2637554776@qq.com>
Date: Wed, 16 Oct 2024 20:39:03 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=8E=92=E5=BA=8F=E4=BB=A3?=
 =?UTF-8?q?=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 codes/polodybala/.18365371.java.swp | Bin 0 -> 12288 bytes
 codes/polodybala/18365371.java      |  33 ++++++++++++++++++++++++++++
 2 files changed, 33 insertions(+)
 create mode 100644 codes/polodybala/.18365371.java.swp
 create mode 100644 codes/polodybala/18365371.java

diff --git a/codes/polodybala/.18365371.java.swp b/codes/polodybala/.18365371.java.swp
new file mode 100644
index 0000000000000000000000000000000000000000..bbdce5a9769257d7d34625f0bf524063e882d22f
GIT binary patch
literal 12288
zcmeI2y>HV%7>BPgc_>9Nv0XueHlcOgC}~juAvOjkREAa=?rcXmb$qVv1f`*{lrmAI
zNCk<Fg#`vAwpM`nCm2|fQy~Wa0S4Z4K0p*0x<&d~dUE!?ANT5!GFXW$+`e&>FU=Pi
zT_^QN|N6eoSfo@keE#3+tu$-pg;G*-!_tOTEMHQM#r5{ep_2Q$p(*UdYk5g~F1GI|
z<(sy0+}I42ubj3NzA&w&V!2dYwC3xgB@Q*g1`NQ!5e-Z(7Z<GTtA6h6G(UZ6`G|c`
z1_Lkv126ysFaQHE00S^Ejs}u&f<2(Yj}3-DGgv47SO<?-U;qYS00v+H24DaNU;qYS
z00v+H2FB2Ua2WeC$(VhDhNs{EhwuMCrWorHpNW0qDbXb)ah<q8oF|SG->CKz@sW5<
zyds_vU1EoLOxz<PA|Td??7T7bg^^(Z24DaNU;qYS00v+H24DaN{%K&7o2DB$%-Cc`
zh9M(YtX1gAtIbTucSRVw&Mfb+VO%E~#vs72@FZ%w6&*DUv0CSOZdLWJ+X!`&Y*TLx
zWBpApNV1fEpqg#cd6ZP;S4X+C9qLe1(Tq;7Q*NO`%Vi$$Id0KyK0g>t(tp)m5%6DA
z)r23@SfgsMU+s;mJu2?7uql1d=5ZntT3X6;xNJ)4ySG%7WXG;nxwy#n00HImoJsI&
zp@>9-=1AW^?Co^Zy(b6Hw|cv84)(Xc?tV!3UjCLO{*t7_LU1X$ZR`7VyW4yFqTeZf
M^o}|)GnZpO0oGc&H2?qr

literal 0
HcmV?d00001

diff --git a/codes/polodybala/18365371.java b/codes/polodybala/18365371.java
new file mode 100644
index 00000000..8b770d97
--- /dev/null
+++ b/codes/polodybala/18365371.java
@@ -0,0 +1,33 @@
+/**
+ * 冒泡排序函数
+ * 对数组进行从小到大的排序
+ * @param a 待排序的数组
+ * @param n 待排序的数组长度
+ */
+public static void bubbleSort(int[] a, int n) {
+    // 外层循环控制遍历的次数
+    for (int i = 0; i < n - 1; i++) {
+        // 提前退出标志位，如果本次没有交换，说明已经有序
+        boolean swapped = false;
+        
+        // 内层循环进行两两比较
+        for (int j = 0; j < n - 1 - i; j++) {
+            // 如果前一个数大于后一个数，则交换
+            if (a[j] > a[j + 1]) {
+                // 交换 a[j] 和 a[j + 1]
+                int temp = a[j];
+                a[j] = a[j + 1];
+                a[j + 1] = temp;
+                
+                // 标记有交换
+                swapped = true;
+            }
+        }
+        
+        // 如果没有发生交换，说明数组已经是有序的，提前结束循环
+        if (!swapped) {
+            break;
+        }
+    }
+} //end
+
-- 
Gitee