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 type of firewall operates at the application layer of the OSI model and inspects incoming and outgoing data packets?
Which type of attack involves injecting malicious SQL code into a web application?
Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?
In Data Communication, what protocol is used to ensure reliable transmission of data over a network?
In a binary search tree (BST), what is true about the left child of a node?
The time complexity of the best case for QuickSort is:
Which of the following properties must a problem exhibit to be solvable by a greedy algorithm?
Which traversal method in a binary search tree retrieves nodes in sorted order?
What is the main advantage of using a linked list over an array?
Which application layer protocol is used to retrieve emails from a remote server?

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