#include <bits/stdc++.h>
 
using namespace std;
 
// A function to merge the two half into a sorted data.
void Merge(int *a, int low, int high, int mid)
{
	// We have low to mid and mid+1 to high already sorted.
	int i, j, k, temp[high-low+1];
	i = low;
	k = 0;
	j = mid + 1;
 
	// Merge the two parts into temp[].
	while (i <= mid && j <= high)
	{
		if (a[i] < a[j])
		{
			temp[k] = a[i];
			k++;
			i++;
		}
		else
		{
			temp[k] = a[j];
			k++;
			j++;
		}
	}
 
	// Insert all the remaining values from i to mid into temp[].
	while (i <= mid)
	{
		temp[k] = a[i];
		k++;
		i++;
	}
 
	// Insert all the remaining values from j to high into temp[].
	while (j <= high)
	{
		temp[k] = a[j];
		k++;
		j++;
	}
 
 
	// Assign sorted data stored in temp[] to a[].
	for (i = low; i <= high; i++)
	{
		a[i] = temp[i-low];
	}
}
 
// A function to split array into two parts.
void MergeSort(int *a, int low, int high)
{
	int mid;
	if (low < high)
	{
		mid=(low+high)/2;
		// Split the data into two half.
		MergeSort(a, low, mid);
		MergeSort(a, mid+1, high);
 
		// Merge them to get sorted output.
		Merge(a, low, high, mid);
	}
}
 
int main()
{
	int n, i;
	n = 1000000;
 
	int arr[n];
	for(i = 0; i < n; i++)
	{
		arr[i] = rand();
	}
 
	MergeSort(arr, 0, n-1);
 
	// Printing the sorted data.
	cout<<"\nSorted Data ";
	for (i = 0; i < n; i++)
        cout<<arr[i]<<"\n";
 
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiAKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAovLyBBIGZ1bmN0aW9uIHRvIG1lcmdlIHRoZSB0d28gaGFsZiBpbnRvIGEgc29ydGVkIGRhdGEuCnZvaWQgTWVyZ2UoaW50ICphLCBpbnQgbG93LCBpbnQgaGlnaCwgaW50IG1pZCkKewoJLy8gV2UgaGF2ZSBsb3cgdG8gbWlkIGFuZCBtaWQrMSB0byBoaWdoIGFscmVhZHkgc29ydGVkLgoJaW50IGksIGosIGssIHRlbXBbaGlnaC1sb3crMV07CglpID0gbG93OwoJayA9IDA7CglqID0gbWlkICsgMTsKIAoJLy8gTWVyZ2UgdGhlIHR3byBwYXJ0cyBpbnRvIHRlbXBbXS4KCXdoaWxlIChpIDw9IG1pZCAmJiBqIDw9IGhpZ2gpCgl7CgkJaWYgKGFbaV0gPCBhW2pdKQoJCXsKCQkJdGVtcFtrXSA9IGFbaV07CgkJCWsrKzsKCQkJaSsrOwoJCX0KCQllbHNlCgkJewoJCQl0ZW1wW2tdID0gYVtqXTsKCQkJaysrOwoJCQlqKys7CgkJfQoJfQogCgkvLyBJbnNlcnQgYWxsIHRoZSByZW1haW5pbmcgdmFsdWVzIGZyb20gaSB0byBtaWQgaW50byB0ZW1wW10uCgl3aGlsZSAoaSA8PSBtaWQpCgl7CgkJdGVtcFtrXSA9IGFbaV07CgkJaysrOwoJCWkrKzsKCX0KIAoJLy8gSW5zZXJ0IGFsbCB0aGUgcmVtYWluaW5nIHZhbHVlcyBmcm9tIGogdG8gaGlnaCBpbnRvIHRlbXBbXS4KCXdoaWxlIChqIDw9IGhpZ2gpCgl7CgkJdGVtcFtrXSA9IGFbal07CgkJaysrOwoJCWorKzsKCX0KIAogCgkvLyBBc3NpZ24gc29ydGVkIGRhdGEgc3RvcmVkIGluIHRlbXBbXSB0byBhW10uCglmb3IgKGkgPSBsb3c7IGkgPD0gaGlnaDsgaSsrKQoJewoJCWFbaV0gPSB0ZW1wW2ktbG93XTsKCX0KfQogCi8vIEEgZnVuY3Rpb24gdG8gc3BsaXQgYXJyYXkgaW50byB0d28gcGFydHMuCnZvaWQgTWVyZ2VTb3J0KGludCAqYSwgaW50IGxvdywgaW50IGhpZ2gpCnsKCWludCBtaWQ7CglpZiAobG93IDwgaGlnaCkKCXsKCQltaWQ9KGxvdytoaWdoKS8yOwoJCS8vIFNwbGl0IHRoZSBkYXRhIGludG8gdHdvIGhhbGYuCgkJTWVyZ2VTb3J0KGEsIGxvdywgbWlkKTsKCQlNZXJnZVNvcnQoYSwgbWlkKzEsIGhpZ2gpOwogCgkJLy8gTWVyZ2UgdGhlbSB0byBnZXQgc29ydGVkIG91dHB1dC4KCQlNZXJnZShhLCBsb3csIGhpZ2gsIG1pZCk7Cgl9Cn0KIAppbnQgbWFpbigpCnsKCWludCBuLCBpOwoJbiA9IDEwMDAwMDA7CiAKCWludCBhcnJbbl07Cglmb3IoaSA9IDA7IGkgPCBuOyBpKyspCgl7CgkJYXJyW2ldID0gcmFuZCgpOwoJfQogCglNZXJnZVNvcnQoYXJyLCAwLCBuLTEpOwogCgkvLyBQcmludGluZyB0aGUgc29ydGVkIGRhdGEuCgljb3V0PDwiXG5Tb3J0ZWQgRGF0YSAiOwoJZm9yIChpID0gMDsgaSA8IG47IGkrKykKICAgICAgICBjb3V0PDxhcnJbaV08PCJcbiI7CiAKCXJldHVybiAwOwp9