Algorithms · Question 6 · Medium
What is the solution of the recurrence T(n) = 2T(n/2) + n, with T(1) = 1?
- O(n)
- O(n²)
- O(log n)
- O(n log n)
Answer and explanation
Answer: D. O(n log n)
Explanation: There are log2 n levels of recursion and each level does a total of n work, giving O(n log n). This is the recurrence of merge sort.
Previous: Merge sort is an example of which algorithm design technique? · Next: What is the maximum number of swaps selection sort performs on an array of n…
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
- Bubble sort is implemented with a flag that stops the algorithm when a pass…
- What is the maximum number of probes (middle-element checks) binary search…
- Merge sort is an example of which algorithm design technique?
- What is the maximum number of swaps selection sort performs on an array of n…
- Quick sort always picks the last element as the pivot. For which input does it…
- What does the following function return for f(4096)?
- Coins of value ₹1, ₹3 and ₹4 are available in unlimited supply. A greedy…
- Insertion sort is applied to [5, 2, 4, 6, 1, 3]. What does the array look like…
- What is the length of the Longest Common Subsequence (LCS) of the strings…
- A 0/1 knapsack has capacity 7 kg. The items (weight, value) are: (1 kg, ₹1)…
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