归并排序

c++实现

#include <iostream>
using namespace std;

void merge(int array1[], int first, int last){
	int mid = (first + last) / 2;
	int i1 = 0;
	int i2 = first;
	int i3 = mid + 1;
	int temp[last - first + 1];

	//左子数组和右子数组都包含元素
	while(i2 <= mid && i3 <= last){
		if(array1[i2] < array1[i3]){
			temp[i1++] = array1[i2++];
		}
		else
			temp[i1++] = array1[i3++];
	}

	//将array1中的剩余元素导入temp,注意两个while条件中的等号
	while(i2 <= mid)
		temp[i1++] = array1[i2++];

	while(i3 <= last)
		temp[i1++] = array1[i3++];

	//将temp中的内容导入array1，注意array1和temp的索引要分开处理
	for(int i = first, j = 0; i <= last; ++i, ++j){
		array1[i] = temp[j];
	}
}

void mergeSort(int data[], int first, int last){
	if(first < last){
		int mid = (first + last) / 2;
		mergeSort(data, first, mid);
		mergeSort(data, mid + 1, last);
		merge(data, first, last);
	}

}

int main(){
	int data[] = {1, 6, 10, 12, 5, 9, 11, 13};
	mergeSort(data, 0, 7);
	for(auto i : data)
		cout<<i<<" ";

    return 0;
}