Merge Sort : Java Sorting Program Code along with Example

Merge sort is a divide and conquer algorithm  that was invented by John von Neumann in 1945.

 Merge sort works as follows
*   Divide the unsorted list into n sublists, each containing 1 element (a list of 1 element is considered sorted).
*    Repeatedly merge sublists to produce new sublists until there is only 1 sublist remaining. This will be the  sorted list.

Read Also :    Quick Sort in Simple words with Example

About The Author

Subham Mittal has worked in Oracle for 3 years .
For more java articles ,Click here to Subscribe JavaHungry