The number of element visits for merge sort totals n + 5n log₂ n.Which of the following is the appropriate big-Oh notation for merge sort? A)n log₂ n B)n+ log₂ n C)n+ 5n D)5n log₂ n

Question

Quizplus · Accepted Answer

The correct big-Oh notation for merge sort is $O(n \log n)$, which reflects the algorithm's divide-and-conquer approach, dividing the problem into smaller subproblems, solving those, and then combining the solutions. This is represented by option A, $n \log n$, after removing the subscript formatting.

The Number of Element Visits for Merge Sort Totals N