Merge Sort
Sorting has always been a popular subject in Computer Science. Back in 1945 Mr. John von Neumann came up with Merge Sort. It’s an efficient divide and conquer algorithm, and we’ll dive right into it. The general flow of the algorithm comes as follows: (1) divide the list into n lists of size 1 (being n the size of the original list), (2) recursively merge them back together to produce one sorted list....