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

The Bellman-Ford algorithm executes relaxation steps how many times for a graph with V vertices?
What happens in a deadlock situation in an operating system?
Which algorithm returns a minimum spanning tree (MST) and uses a priority queue to select the next edge connected to the growing tree?
Recursive problems are implemented by
Which command is used to undo the changes
In Breadth-First Search (BFS), what data structure is typically used to keep track of the nodes to be explored?
What is normalization in the context of databases?
Which of the following protocols is most commonly used in IoT devices to enable communication between smart devices?
For a binary search algorithm to work efficiently, what must be true about the input data?
You need to sort employee records first by department (already grouped) and then by salary, without disturbing the relative order of employees with equal s...

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