我似乎无法弄清楚在 Merge 类中放置比较计数器的位置。尽管它对数组进行了完美的排序,但它不会计算它进行的交换(或比较)的次数。请帮助这是我最终项目的一部分
public static int mergeSort(int[] intArray, int first, int last) {
if(first < last) {
int mid = (first + last) / 2;
mergeSort(intArray, first, mid);
mergeSort(intArray, mid + 1, last);
Merge(intArray, first, mid, last);
}
return comparisons;
}
public static int Merge(int[] intArray, int first, int mid, int last) {
//int count = 0;
comparisons = 0;
int first1 = first, last1 = mid;
int first2 = mid + 1, last2 = last;
int temp[] = new int[intArray.length];
int index = first1;
while(first1 <= last1 && first2 <= last2) {
if(intArray[first1] < intArray[first2]) {
temp[index] = intArray[first1++];
comparisons++;
}
else
temp[index] = intArray[first2++];
index++;
comparisons++;
}
while(first1 <= last1)
temp[index++] = intArray[first1++];
while(first2 <= last2)
temp[index++] = intArray[first2++];
for(index = first; index <= last; index++)
intArray[index] = temp[index];
return comparisons;
}