如何在我的合并排序实现中发现错误？

Question

我试着写一个归并排序算法，但我没看出哪里出错了。你能告诉我我做错了什么吗？或者建议一些有用的 resources/practice 算法？

public class MergeSort {

private int[] auxArray;

public void sort(int[] array)
{
    auxArray = new int[array.length];
    sort(array, 0, array.length - 1);

        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
      }

}

private void sort(int[] array, int begin, int end)
{
    if( begin >= end) return ;

    int middle = begin + (end - begin) / 2;

    sort(array, begin, middle);
    sort(array, middle + 1, end);
    merge(array, begin, middle, end);

}


private void merge(int[] array, int begin, int middle, int end)
{

    int i = begin;
    int j = middle + 1;

    for (int k = begin; k <= end; k++) {
        auxArray[k] = array[k];
    }

    for (int k = begin; k <= end; k++)
    {
        if(i > middle) array[k] = auxArray[j++];
        else if(j > end) array[k] = auxArray[i++];
        else if(array[i] >= array[j])
        {
            array[k] = auxArray[j++];
        }
        else
            array[k] = auxArray[i++];
    }

}

public static void main(String[] args) throws Exception {

    MergeSort sort = new MergeSort();

    int[] array = new int[] {10, 9, 8, 7, 6, 5 ,4, 3, 2 ,1};

    sort.sort(array);

}
}

Answer 1

在merge()中，更改

        else if(array[i] >= array[j])

至

        else if(auxArray[i] >= auxArray[j])

如何在我的合并排序实现中发现错误？

How to find a mistake in my Merge Sort implementation?

java

sorting

algorithm

merge

mergesort