From a041c9c81527c7a6c0a66d733772d5e977873665 Mon Sep 17 00:00:00 2001
From: liangjinglin <liangjinglin@hc-smart.com>
Date: Thu, 16 Jan 2025 22:32:46 +0800
Subject: [PATCH] =?UTF-8?q?2025-01-16=20=E5=BF=AB=E9=80=9F=E6=8E=92?=
 =?UTF-8?q?=E5=BA=8F(=E5=AE=8C=E5=96=84=E5=B0=BE=E6=95=B0=E5=9F=BA?=
 =?UTF-8?q?=E6=95=B0=E6=B3=95)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../java/SortAlgori/QuickSort.java            | 20 +++++++++++--------
 1 file changed, 12 insertions(+), 8 deletions(-)

diff --git a/src/dataANDcalc/java/SortAlgori/QuickSort.java b/src/dataANDcalc/java/SortAlgori/QuickSort.java
index 1035ba7..337933b 100644
--- a/src/dataANDcalc/java/SortAlgori/QuickSort.java
+++ b/src/dataANDcalc/java/SortAlgori/QuickSort.java
@@ -12,17 +12,21 @@ public class QuickSort {
     /**
      * 已最后一个数作为基准(有待完善)
      */
-    //todo 1.如果基准数重复了 2.完整递归
-    private void tailQuicksort(){
-        int index = 0;
-        int mid = arr[arr.length-1];
-        for(int i=0; i<arr.length-1; i++){
-            if(arr[i]<mid){
+    private void tailQuicksort(int start, int end){
+        if(start >= end){
+            return;
+        }
+        int index = start;
+        int mid = arr[end];
+        for(int i=start; i<end-1; i++){
+            if(arr[i]<=mid){
                 swap(i,index);
                 index ++;
             }
         }
-        swap(index,arr.length-1);
+        swap(index,end);
+        tailQuicksort(start,index-1);
+        tailQuicksort(index+1,end);
     }
 
     /**
@@ -86,7 +90,7 @@ public class QuickSort {
         }
         QuickSort quickSort = new QuickSort(arr);
         long startTime = System.currentTimeMillis();
-        quickSort.midQuicksort(0,arr.length-1);
+        quickSort.tailQuicksort(0,arr.length-1);
         long endTime = System.currentTimeMillis();
         System.out.println("排序后的序列：");
         quickSort.show();