我做了快速選擇算法，就是在一個數(shù)組中找到第k個最小的數(shù)。我的問題是，它只適用于沒有重復的數(shù)組。如果我有一個數(shù)組arr = {1,2,2,3,5,5,8,2,4,8,8}它會說第三小的數(shù)字是 2，但實際上是 3。我被困在做什么，這是我的兩個方法 quickSelect 和 Partition：private int quickselect(int[] array, int leftIndex, int rightIndex, int kthSmallest) {    if(kthSmallest > array.length - 1){        System.out.print("Number does not exist. Please enter a number less than: ");        return array.length - 1;    }    if (leftIndex == rightIndex) {        return array[leftIndex];    }    int indexOfPivot = generatePivot(leftIndex, rightIndex);    indexOfPivot = quickSelectPartition(array, leftIndex, rightIndex, indexOfPivot);    if (kthSmallest == indexOfPivot) {        return array[kthSmallest];    } else if (kthSmallest < indexOfPivot) {        return quickselect(array, leftIndex, indexOfPivot - 1, kthSmallest);    } else {        return quickselect(array, indexOfPivot + 1, rightIndex, kthSmallest);    }}private int quickSelectPartition(int[] array, int left, int right, int pivotIndex) {    int pivotValue = array[pivotIndex];    swapIndexes(array, pivotIndex, right);    int firstPointer = left;    for(int secondPointer = left; secondPointer < right; secondPointer++) {        if(array[secondPointer] < pivotValue) {            swapIndexes(array, firstPointer, secondPointer);            firstPointer++;        }    }    swapIndexes(array, right, firstPointer);    return firstPointer;}