From 8636f8ee9bc99b43c66d22ccacbdde5761cf472a Mon Sep 17 00:00:00 2001
From: cyk <29259363314@qq.com>
Date: Fri, 16 Feb 2024 09:54:19 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=8E=92=E5=BA=8F?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 codes/cyk2959363314qq/15195113.java | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 codes/cyk2959363314qq/15195113.java

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


From 479463530fa974721f4c8619f24b453aa1406468 Mon Sep 17 00:00:00 2001
From: cyk <29259363314@qq.com>
Date: Fri, 16 Feb 2024 09:58:24 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=8E=92=E5=BA=8F?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 codes/cyk2959363314qq/15195113.java | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/codes/cyk2959363314qq/15195113.java b/codes/cyk2959363314qq/15195113.java
index a457d716..ecf81b23 100644
--- a/codes/cyk2959363314qq/15195113.java
+++ b/codes/cyk2959363314qq/15195113.java
@@ -7,11 +7,11 @@
 public static void bubbleSort(int [] a, int n){
     // 你的代码，使无序数组 a 变得有序
     for(int i = 0; i < n; i++) {
-	    for(int j = 0; j < n - i; j++) {
-		    if(a[j - 1] > a[j]) {
-			    int temp = a[j - 1];
-			    a [j - 1] = a[j];
-			    a[j] = temp;
+	    for(int j = 0; j < n - i - 1; j++) {
+		    if(a[j] > a[j + 1]) {
+			    int temp = a[j];
+			    a [j] = a[j + 1];
+			    a[j + 1] = temp;
 		    }
 	    }
     }
-- 
Gitee