#include <iostream>
#include <cstdlib>
using namespace std;
//_______________________________
// MERGE SORT
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
/* create temp arrays */
int *L = new int[n1];
int *R = new int[n2];
/* Copy data to temp arrays L[] and R[] */
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
/* Merge the temp arrays back into arr[l..r]*/
i = 0; // Initial index of first subarray
j = 0; // Initial index of second subarray
k = l; // Initial index of merged subarray
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
/* Copy the remaining elements of L[], if there
are any */
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
/* Copy the remaining elements of R[], if there
are any */
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
delete [] L;
delete [] R;
}
/* l is for left index and r is right index of the
sub-array of arr to be sorted */
void mergeSort(int arr[], int l, int r)
{
if (l < r)
{
// Same as (l+r)/2, but avoids overflow for
// large l and h
int m = l + (r - l) / 2;
// Sort first and second halves
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
// END MERGE SORT
//_______________________________
int main() {
int n = 10000000;
int *a = new int[n];
for (int i = 0 ; i < n; ++i)
a[i] = rand() % n;
mergeSort(a, 0, n - 1);
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGxpYj4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCi8vX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fXwovLyBNRVJHRSBTT1JUCnZvaWQgbWVyZ2UoaW50IGFycltdLCBpbnQgbCwgaW50IG0sIGludCByKQp7CiAgICBpbnQgaSwgaiwgazsKICAgIGludCBuMSA9IG0gLSBsICsgMTsKICAgIGludCBuMiA9IHIgLSBtOwoKICAgIC8qIGNyZWF0ZSB0ZW1wIGFycmF5cyAqLwogICAgaW50ICpMID0gbmV3IGludFtuMV07CiAgICBpbnQgKlIgPSBuZXcgaW50W24yXTsKCiAgICAvKiBDb3B5IGRhdGEgdG8gdGVtcCBhcnJheXMgTFtdIGFuZCBSW10gKi8KICAgIGZvciAoaSA9IDA7IGkgPCBuMTsgaSsrKQogICAgICAgIExbaV0gPSBhcnJbbCArIGldOwogICAgZm9yIChqID0gMDsgaiA8IG4yOyBqKyspCiAgICAgICAgUltqXSA9IGFyclttICsgMSArIGpdOwoKICAgIC8qIE1lcmdlIHRoZSB0ZW1wIGFycmF5cyBiYWNrIGludG8gYXJyW2wuLnJdKi8KICAgIGkgPSAwOyAvLyBJbml0aWFsIGluZGV4IG9mIGZpcnN0IHN1YmFycmF5CiAgICBqID0gMDsgLy8gSW5pdGlhbCBpbmRleCBvZiBzZWNvbmQgc3ViYXJyYXkKICAgIGsgPSBsOyAvLyBJbml0aWFsIGluZGV4IG9mIG1lcmdlZCBzdWJhcnJheQogICAgd2hpbGUgKGkgPCBuMSAmJiBqIDwgbjIpCiAgICB7CiAgICAgICAgaWYgKExbaV0gPD0gUltqXSkKICAgICAgICB7CiAgICAgICAgICAgIGFycltrXSA9IExbaV07CiAgICAgICAgICAgIGkrKzsKICAgICAgICB9CiAgICAgICAgZWxzZQogICAgICAgIHsKICAgICAgICAgICAgYXJyW2tdID0gUltqXTsKICAgICAgICAgICAgaisrOwogICAgICAgIH0KICAgICAgICBrKys7CiAgICB9CgogICAgLyogQ29weSB0aGUgcmVtYWluaW5nIGVsZW1lbnRzIG9mIExbXSwgaWYgdGhlcmUKICAgIGFyZSBhbnkgKi8KICAgIHdoaWxlIChpIDwgbjEpCiAgICB7CiAgICAgICAgYXJyW2tdID0gTFtpXTsKICAgICAgICBpKys7CiAgICAgICAgaysrOwogICAgfQoKICAgIC8qIENvcHkgdGhlIHJlbWFpbmluZyBlbGVtZW50cyBvZiBSW10sIGlmIHRoZXJlCiAgICBhcmUgYW55ICovCiAgICB3aGlsZSAoaiA8IG4yKQogICAgewogICAgICAgIGFycltrXSA9IFJbal07CiAgICAgICAgaisrOwogICAgICAgIGsrKzsKICAgIH0KICAgIAogICAgZGVsZXRlIFtdIEw7CiAgICBkZWxldGUgW10gUjsKfQoKLyogbCBpcyBmb3IgbGVmdCBpbmRleCBhbmQgciBpcyByaWdodCBpbmRleCBvZiB0aGUKc3ViLWFycmF5IG9mIGFyciB0byBiZSBzb3J0ZWQgKi8Kdm9pZCBtZXJnZVNvcnQoaW50IGFycltdLCBpbnQgbCwgaW50IHIpCnsKICAgIGlmIChsIDwgcikKICAgIHsKICAgICAgICAvLyBTYW1lIGFzIChsK3IpLzIsIGJ1dCBhdm9pZHMgb3ZlcmZsb3cgZm9yCiAgICAgICAgLy8gbGFyZ2UgbCBhbmQgaAogICAgICAgIGludCBtID0gbCArIChyIC0gbCkgLyAyOwoKICAgICAgICAvLyBTb3J0IGZpcnN0IGFuZCBzZWNvbmQgaGFsdmVzCiAgICAgICAgbWVyZ2VTb3J0KGFyciwgbCwgbSk7CiAgICAgICAgbWVyZ2VTb3J0KGFyciwgbSArIDEsIHIpOwoKICAgICAgICBtZXJnZShhcnIsIGwsIG0sIHIpOwogICAgfQp9Ci8vIEVORCBNRVJHRSBTT1JUCi8vX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fXwoKaW50IG1haW4oKSB7CglpbnQgbiA9IDEwMDAwMDAwOwoJaW50ICphID0gbmV3IGludFtuXTsKCQoJZm9yIChpbnQgaSA9IDAgOyBpIDwgbjsgKytpKQoJCWFbaV0gPSByYW5kKCkgJSBuOwoJCgltZXJnZVNvcnQoYSwgMCwgbiAtIDEpOwoJCglyZXR1cm4gMDsKfQ==