merge sort


Merge Sort also uses Divide and Conquer rule for its operation. Merge sort starts sorting 
by dividing the list into sublist recursively until the sublist consist of one element.
And starts merges the element in the proper order. 
Like quick sort, merge sort also works well in larger lists, but use of additional list
makes merge sort disadvantageous one.