Merge Sort in Java

Merge sort is based on the divide-and-conquer paradigm. It is invented by John von Neumann in 1945. Merge sort is a stable sorting algorithm which in mostly implemented. In this algorithm, Divide the unsorted list into n sublists, each containing 1 element. Then, repeatedly merge sublists to produce new sorted sublists until there is only 1 sublist remaining. This will be the sorted list.

Click here for Merge sort in Java