Give two instances for which the Mergesort algorithm is the

Give two instances for which the Mergesort algorithm is the most appropriate choice.

Solution

Mergesort is appropriate choice when elements are stored in linked lists. Databases use merge sort to sort sets of data that are very large and cannot be loaded entirely into memory. appropriate for divide and conquer and recursive problems