 Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945.A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and von Neumann as early as 1948.Conceptually, a merge sort works as follows