java MergeSort实现提供了StackOverflow
我一直在尝试实现一个MergeSort,它将数组分成三个部分,而不是两个部分。我似乎在某个地方遇到了堆栈溢出异常。有人能帮我找到吗?(第54、58、59行报告了SOs)
导入java。util; 导入java。伊奥
类MergeSortQuestion{
// merges sorted subarrays A[start...firstThird], A[firstThird+1,secondThird], and A[secondThird+1,stop]
public static void mergeThreeWay(int A[], int start, int firstThird, int secondThird, int stop)
{
int indexLeft = start;
int indexFirstThird = firstThird+1;
int indexSecondThird = secondThird+1;
int tmp1[] = new int[A.length];
int tmpIndex = start;
while(tmpIndex <= firstThird){
if (indexFirstThird < firstThird || (indexLeft <= firstThird && A[indexLeft] <= A[indexFirstThird])){
tmp1[tmpIndex] = A[indexLeft];
indexLeft++;
}else if(indexSecondThird < secondThird || (indexFirstThird <= secondThird && A[firstThird] <= A[indexSecondThird])){
tmp1[tmpIndex] = A[indexFirstThird];
indexFirstThird++;
}else{
tmp1[tmpIndex] = A[indexSecondThird];
indexSecondThird = indexSecondThird + 1;
}
tmpIndex++;
}
int i = 0;
for(int temp : tmp1){
A[i] = temp;
i++;
}
}
// sorts A[start...stop]
public static void mergeSortThreeWay(int A[], int start, int stop) {
if (start < stop){
int firstThird = (start+stop)/3;
int secondThird = 2*(firstThird);
mergeSortThreeWay(A, start, firstThird);
mergeSortThreeWay(A, firstThird+1, secondThird);
mergeSortThreeWay(A, secondThird+1, stop);
mergeThreeWay(A, start, firstThird, secondThird, stop);
}
}
public static void main (String args[]) throws Exception {
int myArray[] = {8,3,5,7,9,2,3,5,5,6};
mergeSortThreeWay(myArray,0,myArray.length-1);
System.out.println("Sorted array is:\n");
for (int i=0;i<myArray.length;i++) {
System.out.println(myArray[i]+" ");
}
}
}
# 1 楼答案
你的
firstThird
和secondThird
变量在mergeSortThreeWay
执行过程中的某一点上不会在一次迭代到另一次迭代之间改变值。 以你为例,我得到:计算
firstThird
和secondThird
的公式似乎不起作用。尝试使用