From def9cfb40155b76f91fb95fcba2ee761e3dee555 Mon Sep 17 00:00:00 2001
From: Setinsung <1968989251@qq.com>
Date: Mon, 19 Sep 2022 16:56:47 +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/Setinsung/.java        |  0
 codes/Setinsung/9697451.java | 19 +++++++++++++++++++
 2 files changed, 19 insertions(+)
 create mode 100644 codes/Setinsung/.java
 create mode 100644 codes/Setinsung/9697451.java

diff --git a/codes/Setinsung/.java b/codes/Setinsung/.java
new file mode 100644
index 000000000..e69de29bb
diff --git a/codes/Setinsung/9697451.java b/codes/Setinsung/9697451.java
new file mode 100644
index 000000000..7368d1f00
--- /dev/null
+++ b/codes/Setinsung/9697451.java
@@ -0,0 +1,19 @@
+
+/**
+ * 冒泡排序函数
+ * aa bb cc
+ * @param a 待排序的数组
+ * @param n 待排序的数组长度
+ */
+public static void bubbleSort(int [] a, int n){
+    // 你的代码，使无序数组 a 变得有序
+	for(int i=0;i<a.length-1;i++){
+            for(int j =0;j<a.length-1-i;j++){
+                if(a[j]>a[j+1]){
+                    a[j] = a[j]+a[j+1];
+                    a[j+1] = a[j]-a[j+1];
+                    a[j] = a[j]-a[j+1];
+                }
+            }
+        }
+} //end	
-- 
Gitee