Question

The number of comparisons needed in the worst case by the merge sort algorithm will be

Answer 1

An example of merge sort. First divide the list into the smallest unit (1 element), then compare each element with the adjacent list to sort and merge the two adjacent lists. Finally all the elements are sorted and merged.

Class Sorting algorithm

Data structure Array

Worst-case performance O(n log n)

Answer 2

Explanation:

the number of comparison needed in worst case by merge sort algorithm