From 6bea3794eb6b6997e48499ca55af0bc18b37629e Mon Sep 17 00:00:00 2001
From: beloved2021 <24118287168@qq.com>
Date: Fri, 24 Jan 2025 17:03:50 +0800
Subject: [PATCH 1/3] =?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/19393237 | 35 +++++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 codes/19393237

diff --git a/codes/19393237 b/codes/19393237
new file mode 100644
index 000000000..a5ce61710
--- /dev/null
+++ b/codes/19393237
@@ -0,0 +1,35 @@
+/**
+ * 冒泡排序函数
+ * aa bb cc
+ * @param a 待排序的数组
+ * @param n 待排序的数组长度
+ */
+public static void bubbleSort(int [] a, int n){
+    // 你的代码，使无序数组 a 变得有序
+        //对34,5,22,-98,6,-76,0,-3这一组数从小到大排序
+        int arr[] = new int[]{34, 5, 22, -98, 6, -76, 0, -3};
+        //外层循环控制排序的次数
+        for (int i = 0; i < arr.length - 1; i++) {
+            //内层循环读取数组的元素进行比较
+            for (int j = 0; j < arr.length - 1 - i; j++) {
+                //数组第一个元素与第二个元素相比较，如果第一个元素大
+                //则交换位置，实现从小到大排序；如果从大到小，则是“<”符号
+                if (arr[j] > arr[j + 1]) {
+                    int temp = arr[j];
+                    arr[j] = arr[j + 1];
+                    arr[j + 1] = temp;
+                }
+            }
+        }
+        //循环遍历输出数组中的每一个元素
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+
+    }
+}
+
+
+
+} //end
+
-- 
Gitee


From 6fb97e150fc6a51d635d9565d080528945299d25 Mon Sep 17 00:00:00 2001
From: beloved2021 <2418287168@qq.com>
Date: Fri, 24 Jan 2025 17:20:45 +0800
Subject: [PATCH 2/3] =?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/19393237.java | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 codes/19393237.java

diff --git a/codes/19393237.java b/codes/19393237.java
new file mode 100644
index 000000000..761e9e720
--- /dev/null
+++ b/codes/19393237.java
@@ -0,0 +1,27 @@
+
+
+    public static void bubbleSort(int [] a, int n){
+        //对34,5,22,-98,6,-76,0,-3这一组数从小到大排序
+        int arr[] = new int[]{34, 5, 22, -98, 6, -76, 0, -3};
+        //外层循环控制排序的次数
+        for (int i = 0; i < arr.length - 1; i++) {
+            //内层循环读取数组的元素进行比较
+            for (int j = 0; j < arr.length - 1 - i; j++) {
+                //数组第一个元素与第二个元素相比较，如果第一个元素大
+                //则交换位置，实现从小到大排序；如果从大到小，则是“<”符号
+                if (arr[j] > arr[j + 1]) {
+                    int temp = arr[j];
+                    arr[j] = arr[j + 1];
+                    arr[j + 1] = temp;
+                }
+            }
+        }
+        //循环遍历输出数组中的每一个元素
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+
+    }
+}//end
+
+
-- 
Gitee


From d0e7700db720f4b7cfe862c1ac5a8780144e7023 Mon Sep 17 00:00:00 2001
From: beloved2021 <2418287168@qq.com>
Date: Fri, 24 Jan 2025 17:27:56 +0800
Subject: [PATCH 3/3] =?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

---
 beloved2021/19393237.java | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 beloved2021/19393237.java

diff --git a/beloved2021/19393237.java b/beloved2021/19393237.java
new file mode 100644
index 000000000..6a4219d45
--- /dev/null
+++ b/beloved2021/19393237.java
@@ -0,0 +1,27 @@
+
+    public static void bubbleSort(int [] a, int n){
+        //对34,5,22,-98,6,-76,0,-3这一组数从小到大排序
+        int arr[] = new int[]{34, 5, 22, -98, 6, -76, 0, -3};
+        //外层循环控制排序的次数
+        for (int i = 0; i < arr.length - 1; i++) {
+            //内层循环读取数组的元素进行比较
+            for (int j = 0; j < arr.length - 1 - i; j++) {
+                //数组第一个元素与第二个元素相比较，如果第一个元素大
+                //则交换位置，实现从小到大排序；如果从大到小，则是“<”符号
+                if (arr[j] > arr[j + 1]) {
+                    int temp = arr[j];
+                    arr[j] = arr[j + 1];
+                    arr[j + 1] = temp;
+                }
+            }
+        }
+        //循环遍历输出数组中的每一个元素
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+
+    }
+}//end
+
+
+
-- 
Gitee