Pseudocode

Merge Sort has a worst-case time complexity of O(n*log(n)), which is more efficient than many other sorting algorithms such as sort.

The merge sort algorithm is also an example of the -conquer algorithm paradigm.

Merge sort is efficient when sorting large datasets because of its time complexity.

Merge Sort was invented by John von Neumann in 1945, although it was later independently developed by several other computer scientists. It is an example of a -based sorting algorithm.