归并排序

#include<iostream>

/**
归并排序 -- 将两个有序表直接归并为一个有序表的算法称为归并排序，设两个有序表存放在同一
数组相邻位置：R[left..mid]和R[mid+1..right]。从两个表第一元素开始，每次从两个表取出一
个元素进行比较，将较小者放入临时数组R1中，直到其中一个表的元素全部放入R1为止，将另一个
表余下的元素赋值到R1，这样R1是一个有序表，再将其复制回R中。
**/
int main()
{
	int arr[6] = {1,25,26,20,21,35};
	int hp[6] = {0,0,0,0,0,0};
	void merge_sort( int array[], int helper[], int left, int mid, int right);

	merge_sort(arr,hp,0,2,5);

	for( int i = 0; i < 6; i++ )
		std::cout<<arr[i]<<std::endl;
	return 0;
}

void merge_sort( int array[], int helper[], int left, int mid, int right) {
	int helperLeft = left;
	int helperRight = mid + 1;
	int curr = left;

	for(int i = left; i <= right; i++)
		helper[i] = array[i];

	while( helperLeft <= mid && helperRight <= right ) {
		if( helper[helperLeft] <= helper[helperRight])
			array[curr++] = helper[helperLeft++];
		else
			array[curr++] = helper[helperRight++];
	}

	while( helperLeft <= mid )
		array[curr++] = helper[helperLeft++];

	while( helperRight <= right )
		array[curr++] = helper[helperRight++];
}