From d275f990acfb8c4302f855906364984a3baaf7e6 Mon Sep 17 00:00:00 2001
From: liangjinglin <liangjinglin@hc-smart.com>
Date: Thu, 16 Jan 2025 00:34:55 +0800
Subject: [PATCH] =?UTF-8?q?2025-01-15=20=E9=80=89=E6=8B=A9=E6=8E=92?=
 =?UTF-8?q?=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../java/SortAlgori/BubbleSort.java           |  4 +-
 .../java/SortAlgori/SelectSort.java           | 52 +++++++++++++++++++
 2 files changed, 54 insertions(+), 2 deletions(-)
 create mode 100644 src/dataANDcalc/java/SortAlgori/SelectSort.java

diff --git a/src/dataANDcalc/java/SortAlgori/BubbleSort.java b/src/dataANDcalc/java/SortAlgori/BubbleSort.java
index 5a2bc35..06c45df 100644
--- a/src/dataANDcalc/java/SortAlgori/BubbleSort.java
+++ b/src/dataANDcalc/java/SortAlgori/BubbleSort.java
@@ -49,9 +49,9 @@ public class BubbleSort {
     }
 
     public static void main(String[] args) {
-        int[] arr = new int[10000];
+        int[] arr = new int[50000];
         System.out.println("排序前的序列：");
-        for(int i=0; i<10000; i++){
+        for(int i=0; i<50000; i++){
             arr[i] = (int)(Math.random()*1000000);
             System.out.print(arr[i] + " ");
         }
diff --git a/src/dataANDcalc/java/SortAlgori/SelectSort.java b/src/dataANDcalc/java/SortAlgori/SelectSort.java
new file mode 100644
index 0000000..58024f1
--- /dev/null
+++ b/src/dataANDcalc/java/SortAlgori/SelectSort.java
@@ -0,0 +1,52 @@
+package SortAlgori;
+
+public class SelectSort {
+
+    private int[] arr;
+
+    public SelectSort(int[] arr){
+        this.arr = arr;
+    }
+
+    public void sort(){
+        for (int i = 0; i<arr.length; i++){
+            int temp = arr[i];
+            int index = i;
+            for(int j=i+1; j<arr.length; j++){
+                if(temp>arr[j]){
+                    temp = arr[j];
+                    index = j;
+                }
+            }
+
+            if(index != i){
+                arr[index] = arr[i];
+                arr[i] = temp;
+            }
+        }
+    }
+
+    public void show(){
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+        System.out.println();
+    }
+
+    public static void main(String[] args) {
+        int[] arr = new int[50000];
+        System.out.println("排序前的序列：");
+        for(int i=0; i<50000; i++){
+            arr[i] = (int)(Math.random()*1000000);
+            System.out.print(arr[i] + " ");
+        }
+        System.out.println();
+        SelectSort selectSort = new SelectSort(arr);
+        long startTime = System.currentTimeMillis();
+        selectSort.sort();
+        long endTime = System.currentTimeMillis();
+        System.out.println("排序后的序列：");
+        selectSort.show();
+        System.out.println("排序所花费的时间：" + (endTime - startTime) + "ms");
+    }
+}