归并排序

代码

public void mergeSort() // called by main()
{ // provides workspace
	long[] workSpace = new long[nElems];
	recMergeSort(workSpace, 0, nElems - 1);
}

// -----------------------------------------------------------
private void recMergeSort(long[] workSpace, int lowerBound, int upperBound) {
	if (lowerBound == upperBound) // if range is 1,
		return; // no use sorting
	else { // find midpoint
		int mid = (lowerBound + upperBound) / 2;
		// sort low half
		recMergeSort(workSpace, lowerBound, mid);
		// sort high half
		recMergeSort(workSpace, mid + 1, upperBound);
		// merge them
		merge(workSpace, lowerBound, mid + 1, upperBound);
	} // end else
} // end recMergeSort()

// -----------------------------------------------------------
private void merge(long[] workSpace, int lowPtr, int highPtr, int upperBound) {
	int j = 0; // workspace index
	int lowerBound = lowPtr;
	int mid = highPtr - 1;
	int n = upperBound - lowerBound + 1; // # of items

	while (lowPtr <= mid && highPtr <= upperBound)
		if (theArray[lowPtr] < theArray[highPtr])
			workSpace[j++] = theArray[lowPtr++];
		else
			workSpace[j++] = theArray[highPtr++];

	while (lowPtr <= mid)
		workSpace[j++] = theArray[lowPtr++];

	while (highPtr <= upperBound)
		workSpace[j++] = theArray[highPtr++];

	for (j = 0; j < n; j++)
		theArray[lowerBound + j] = workSpace[j];
} // end merge()