當我實現Quicksort方法時堆棧溢出

Question

你好我正在嘗試在Java中實現Quicksort方法，但由於某種原因，當我只做5個元素時，出現堆棧溢出錯誤！任何想法可能是錯的？我的代碼的 部分：

class QuickSort implements AbstractSort { 
    public int partition(int[] numbers, int start, int end) 
    { 
     int pivot = numbers[end]; 
     int theIndex = start; 
     int temp; 
     for(int i = start; i <= end - 1; i++) 
     { 
      if(numbers[i] <= pivot) 
      { 
       temp = numbers[theIndex]; 
       numbers[theIndex] = numbers[i]; 
       numbers[i] = temp; 
       theIndex++; 
      } 
     } 
     temp = numbers[theIndex]; 
     numbers[theIndex] = pivot; 
     numbers[end] = temp; 
     return theIndex; 
    } 

    public void mySort(int[] numbers, int start, int end) 
    { 
     if(start < end) 
     { 
      int myIndex = partition(numbers, start, end); 

      mySort(numbers, 0, myIndex-1); 
      mySort(numbers, myIndex + 1, numbers.length - 1); 
     } 
     else 
     { 
      return; 
     } 
    } 
    public void sort(int[] numbers) 
    { 
     mySort(numbers, 0, numbers.length - 1); 
    } 
} 

Answer 1

在mySort(numbers, 0, myIndex-1);我應該把開始，而不是0，所以正確的代碼看起來像這樣mySort(numbers, start, myIndex-1);