MergeSorting 算法不工作。繼續得到一個IndexOutOFBoundsError。我相信問題可能是因為沒有哨兵。leftarray當andrightarray將自身復制到時，我需要創建一個循環k，其中一個數組用完了數字，這會導致錯誤。我需要一些幫助來創建這個哨兵。private static <T> void mergeSort(Comparable<? extends T>[] items, int begIndx, int endIndx) {    if (items.length > 1) {        int midIndx = items.length / 2;        @SuppressWarnings("unchecked")        T[] left = (T[]) new Object[midIndx];        @SuppressWarnings("unchecked")        T[] right = (T[]) new Object[items.length - midIndx];        for (int i = 0; i < midIndx; i++) {            left[i] = (T) items[i];        }        for (int i = midIndx; i < items.length; i++) {            right[i] = (T) items[i];        }        mergeSort(items, begIndx, midIndx);        mergeSort(items, midIndx + 1, endIndx);        merge(items, begIndx, midIndx, endIndx);    }}@SuppressWarnings("unchecked")private static <T> void merge(Comparable<? extends T>[] array,                              int begIndx, int midIndx, int endIndx) {    int sizeOfLeft = midIndx - begIndx + 1;    int sizeOfRight = endIndx - midIndx;    /// change to generic later    @SuppressWarnings("unchecked")    T[] leftArr = (T[]) new Object[sizeOfLeft + 1];    @SuppressWarnings("unchecked")    T[] rightArr = (T[]) new Object[sizeOfRight + 1];    for (int i = 0; i < sizeOfLeft; i++) {        leftArr[i] = (T) array[begIndx + i];    }    for (int j = 0; j < sizeOfRight; j++) {        rightArr[j] = (T) array[midIndx + j + 1];    }    int i = 0;    int j = 0;    // changed to less than or equal to rather than "less than"    // this is because this is a zero based index system    // and because endeIndex is not a length but an index,    // you need to populate it.    for (int k = begIndx; k <= endIndx; k++) {        // use comparable here        if (((Integer) leftArr[i]).compareTo((Integer) rightArr[j]) <= 0) {            array[k] = (Comparable<? extends T>) leftArr[i];            i = i + 1;        }         }    }}我創建了一個整數數組arr = new Integer[5]。所以應該對這 5 個數字進行排序。