From 425141d69ee95ac0131c8601e45bec0e3ff81e82 Mon Sep 17 00:00:00 2001
From: zhaohang <zhao.hang@linux.alibaba.com>
Date: Thu, 3 Nov 2022 02:46:26 +0000
Subject: [PATCH 1/2] =?UTF-8?q?=E6=96=B0=E5=BB=BA=20zhaohang202?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 codes/zhaohang202/.keep | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 create mode 100644 codes/zhaohang202/.keep

diff --git a/codes/zhaohang202/.keep b/codes/zhaohang202/.keep
new file mode 100644
index 00000000..e69de29b
-- 
Gitee


From 776b6265f3a0229f644070baec0fe505520f6eb8 Mon Sep 17 00:00:00 2001
From: zhaohang <zhao.hang@linux.alibaba.com>
Date: Thu, 3 Nov 2022 02:48:01 +0000
Subject: [PATCH 2/2] add codes/zhaohang202/10040692.java.

Signed-off-by: zhaohang <zhao.hang@linux.alibaba.com>
---
 codes/zhaohang202/10040692.java | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 codes/zhaohang202/10040692.java

diff --git a/codes/zhaohang202/10040692.java b/codes/zhaohang202/10040692.java
new file mode 100644
index 00000000..29d27043
--- /dev/null
+++ b/codes/zhaohang202/10040692.java
@@ -0,0 +1,23 @@
+/**
+ * 冒泡排序函数
+ * aa bb cc
+ * @param a 待排序的数组
+ * @param n 待排序的数组长度
+ */
+public static void bubbleSort(int [] a, int n){
+    // 你的代码，使无序数组 a 变得有序
+    for (int i = 0; i < n-1; i++) { 
+      for (int j = 0; j < n-1-i; j++) { 
+        if (a[j] >= a[j+1]) { 
+          int temp = a[j]; 
+          a[j] = a[j+1]; 
+          a[j+1] = temp; 
+        } 
+      } 
+    } 
+      
+    System.out.print("冒泡排序的结果是： "); 
+    for (int i : a) { 
+      System.out.print(i + " "); 
+    }
+} //end
\ No newline at end of file
-- 
Gitee