Algorithms · Question 19 · Easy
What is the worst-case time complexity of merge sort on n elements?
- O(n log n)
- O(n)
- O(log n)
- O(n²)
Answer and explanation
Answer: A. O(n log n)
Explanation: Merge sort always splits the array in half (about log n levels) and merges each level in O(n) time, so even its worst case is O(n log n).
Previous: Which algorithm finds single-source shortest paths correctly even when some… · Next: What is the time complexity of finding the largest element in an unsorted…
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- What is the best-case time complexity of linear search on an array of n…
- Which of the following sorting algorithms is stable in its standard…
- Which algorithm finds single-source shortest paths correctly even when some…
- What is the time complexity of finding the largest element in an unsorted…
- Bubble sort is applied to the array [4, 1, 3, 2] in ascending order. What does…
- Two sorted lists with 6 and 9 elements are merged into one sorted list using…
- An undirected weighted graph has the edges A-B 4, A-C 1, B-C 2, B-D 5, C-D 8…
- What is the solution of the recurrence T(n) = T(n - 1) + n, with T(1) = 1?
- Coins of ₹2, ₹3 and ₹5 are available in unlimited supply. In how many…
- Selection sort (ascending) is applied to [29, 10, 14, 37, 13]. In each pass…
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge