In the textbook, we found that the number of element visits for merge sort totaled n + 5n log₂n. Which of the following is the appropriate big-Oh notation for merge sort? A) 5n log₂n B) n + log₂n C) n + 5n D) n log₂n

Name: In the textbook, we found that the number of element visits for merge sort totaled n + 5n log 2 n. Which of the following is the appropriate big-Oh notation for merge sort? A) 5n log 2 n B) n + log 2 n C) n + 5n D) n log 2 n
Brand: Quizplus
Rating: 5.0 (34 reviews)

Question

Quizplus · Accepted Answer

Merge sort has a time complexity of O(n log n).

In the Textbook, We Found That the Number of Element