Algorithms · Question 22 · Medium
Algorithms question 22
Two sorted lists with 6 and 9 elements are merged into one sorted list using the standard merge procedure. What is the maximum number of comparisons needed?
- 14
- 15
- 54
- 9
Answer and explanation
Answer: A. 14
Explanation: Each comparison places one element. In the worst case one list runs out only when a single element of the other remains, so the merge takes m + n - 1 = 6 + 9 - 1 = 14 comparisons.
Previous: Bubble sort is applied to the array [4, 1, 3, 2] in ascending order. What does… · Next: An undirected weighted graph has the edges A-B 4, A-C 1, B-C 2, B-D 5, C-D 8…
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 worst-case time complexity of merge sort on n elements?
- 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…
- 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…
- What is the edit distance (minimum number of single-character insertions…
- Four matrices with dimensions 5×10, 10×3, 3×12 and 12×5 are multiplied as a…
- Lomuto partition with the last element as the pivot is applied once to [7, 2…
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