From e43b4dcbe1aed7b751a3fcbc6cf622566e613b8f Mon Sep 17 00:00:00 2001
From: codewen77 <1533968491@qq.com>
Date: Thu, 3 Nov 2022 05:28:50 +0000
Subject: [PATCH 1/2] =?UTF-8?q?=E6=96=B0=E5=BB=BA=20codewen77?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/codes/codewen77/.keep b/codes/codewen77/.keep
new file mode 100644
index 000000000..e69de29bb
-- 
Gitee


From c34731de7585ae81d1a7299ba4ac6d0aa19cdde0 Mon Sep 17 00:00:00 2001
From: codewen77 <1533968491@qq.com>
Date: Thu, 3 Nov 2022 05:30:29 +0000
Subject: [PATCH 2/2] add codes/10042144.java. ssefsfd

Signed-off-by: codewen77 <1533968491@qq.com>
---
 codes/10042144.java | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 codes/10042144.java

diff --git a/codes/10042144.java b/codes/10042144.java
new file mode 100644
index 000000000..481ec5445
--- /dev/null
+++ b/codes/10042144.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 < n - 1 ; i++){
+    	for(int j = 0 ; j < n - 1 - i ; j++){
+		if(a[j] > a[j + 1]){
+			int tmp = a[j];
+			a[j] = a[j + 1];
+			a[j + 1] = tmp;
+		}
+	}
+    }
+
+} //end
\ No newline at end of file
-- 
Gitee