*************************************
This program is to sort
the given numbers in increasing order
using merge sort algorithm (recursion)
*************************************
Enter the no of elements to be sorted ::5
Now enter 5 elements ::5 4 3 2 1
The sorted list is ::
1 2 3 4 5
Press any key to continue

How does recursion do the sorting of your left array and then right array , I have spent hrs on understanding the 2 recursive calls and all i end up is only confusion . Could u plz explain its idea by an example b/c it boils down to containing single element .

If the code doesn't work, please replace the single quotes and double quotes(Actually these are not proper single and double quotes) in the code with single quotes and double quotes using your keyboard..