Changes

It has been adjust to work only with int arrays and perform operation on worst case scenario for merge sort, which is something similar to this array - [0, 2, 4, 6, 1, 3, 5, 7].

<b>CODE</b>

To compile on matrix - <b>g++ -O2 -g -pg -oa1 a1.cpp</b>

</source>

<b>Profiling</b>

<source>

</source>

The most time consuming part is merging, which can be at least partially paralleled. The Big(O) of this case is O(n).