From 9f9348ae5efec8b2fbc966452aa61132a72e0f40 Mon Sep 17 00:00:00 2001
From: xuxin <840198532@qq.com>
Date: Tue, 3 Feb 2026 15:04:09 +0800
Subject: [PATCH] =?UTF-8?q?=E8=BF=9B=E9=98=B6day04-=E5=86=92=E6=B3=A1?=
 =?UTF-8?q?=E6=8E=92=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../com/inmind/interface_return03/Demo11.java | 23 +++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 javaSE-day04/src/com/inmind/interface_return03/Demo11.java

diff --git a/javaSE-day04/src/com/inmind/interface_return03/Demo11.java b/javaSE-day04/src/com/inmind/interface_return03/Demo11.java
new file mode 100644
index 0000000..0ffc512
--- /dev/null
+++ b/javaSE-day04/src/com/inmind/interface_return03/Demo11.java
@@ -0,0 +1,23 @@
+package com.inmind.interface_return03;
+
+import java.util.Arrays;
+
+//在线教程中的冒泡排序
+public class Demo11 {
+    public static void main(String[] args) {
+        int[] arr = {70,61,55,34,23};
+        System.out.println("排序前："+Arrays.toString(arr));
+        for (int i = 0; i < arr.length - 1; i++) {//外层循环的趟数
+            for (int j = 0; j < arr.length - 1 - i; j++) {//内层循环的次数
+                //内层循环在比较时，相邻的2个比较，大的往后替换
+                if (arr[j] > arr[j + 1]) {
+                    int temp = arr[j];//记录较大的值
+                    arr[j] = arr[j + 1];//将较小的值靠前
+                    arr[j+1] = temp;
+                }
+            }
+        }
+
+        System.out.println("排序后："+Arrays.toString(arr));
+    }
+}