Merge sort using Javascript

Merge sort is divide and conquer Algotithm
Works as follows

• Divide the unsorted list in to n sublists, each containing 1 element
• Repeatedly merge the sublists to produce sorted list, until only one sublist is remaining. Which is a so