#include<iostream>using namespace std;void merge(int data[],int low,int high,int mid){	int a[mid-low+1],b[high-mid];	int i,j,k;	for(int m = 0;m < mid-low+1;m ++)		a[m] = data[low+m];	for(int n = 0;n <high-mid; n ++ ) 		b[n] = data[mid+1+n];	i = j = 0 ;	k = low;	while(i < mid-low+1 && j < high-mid)		if(a[i] <= b[j])			data[k++] = a[i++];		else			data[k++] = b[j++];	while(i < mid-low+1)		data[k++] = a[i++];	while(j < high-mid)		data[k++] = b[j++];} void mergesort(int data[],int low,int high){	int mid;	if(low < high)		{			mid = int((low + high)/2);			mergesort(data,low,mid);			mergesort(data,mid+1,high);			merge(data,low,high,mid);		}}int main(){	int data[10] = {3,6,1,9,4,5,2,7,0,8};	mergesort(data,0,9);	for(int i = 0;i < 10;i ++) 		cout<<data[i]<<" ";	cout<<endl;	return 0;}