Question

pseudocode algorithm for merge sorting ​

Answer 1

Explanation:

Pseudocode

Merge Sort is a divide and conquer algorithm. It works by continually splitting a list in half until both halves are sorted, then the operation merge is performed to combine two lists into one sorted new list. When splitting a list, we consider the list is sorted if it contains zero or one element.