Login / Signup

Question

Which sorting algorithm uses the 'Divide and Conquer' strategy and what is its recurrence relation?

A Bubble Sort — T(n) = T(n−1) + O(n)

B Insertion Sort — T(n) = T(n−1) + O(1)

C Merge Sort — T(n) = 2T(n/2) + O(n), solving to O(n log n)

D Selection Sort — T(n) = T(n−1) + O(n)

E Counting Sort — T(n) = O(n+k) with no recurrence relation

Practice Next

More Algorithms Questions

Which of the following is a primary characteristic of Black Box Testing in software testing?
Which of the following is a primary challenge associated with Cloud Security?
A bank's customer database has 1,000,000 sorted records. Compare the maximum number of comparisons needed by Linear Search vs Binary Search to find a speci...
In the 0/1 knapsack problem, items have weights (1, 3, 4, 5) and values (1, 4, 5, 7), and the knapsack capacity is 7. What is the maximum total value that ...
What is the space complexity of Bubble Sort?
What is the primary purpose of virtualization in cloud computing?
Converting binary number 110001 to decimal will result in:
For a comparison-based sorting algorithm, which lower bound applies to the worst-case number of comparisons?
Which algorithm uses a priority queue to repeatedly pick the next closest vertex?
What is the time complexity of inserting an element in a heap?

Relevant for Exams:

Central Bank of India SO

Hey! Ask a query

ask-question

🎓

Think You're Ready for RBI Grade B?

RBI Grade B 2026 Phase 1 Memory Based Paper

200 Questions with Detailed Solutions
Section-wise Coverage (GA, English, Quant & Reasoning)

Download Now 100% Free PDF