From b883bb6c31a78f47e49c447b44b78894058639c1 Mon Sep 17 00:00:00 2001
From: jiasx <jiasxin@qq.com>
Date: Tue, 20 Sep 2022 11:03:57 +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/it996it/9703321.java | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 codes/it996it/9703321.java

diff --git a/codes/it996it/9703321.java b/codes/it996it/9703321.java
new file mode 100644
index 00000000..c1d04829
--- /dev/null
+++ b/codes/it996it/9703321.java
@@ -0,0 +1,29 @@
+/**
+ * 冒泡排序函数
+ * aa bb cc
+ * @param a 待排序的数组
+ * @param n 待排序的数组长度
+ */
+public static void bubbleSort(int [] a, int n){
+    // 你的代码，使无序数组 a 变得有序
+    // 对 arr 进行拷贝，不改变参数内容
+        int[] arr = Arrays.copyOf(a,n);
+        for (int i = 1; i < arr.length; i++) {
+            // 设定一个标记，若为true，则表示此次循环没有进行交换，也就是待排序列已经有序，排序已经完成。
+            boolean flag = true;
+            for (int j = 0; j < arr.length - i; j++) {
+                if (arr[j] > arr[j + 1]) {
+                    int tmp = arr[j];
+                    arr[j] = arr[j + 1];
+                    arr[j + 1] = tmp;
+                    flag = false;
+                }
+            }
+            if (flag) {
+                break;
+            }
+        }
+        return arr;
+    }
+
+} //end
-- 
Gitee