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 problems cannot be solved using greedy algorithms for optimal result?
Which of the following design patterns is primarily used to create objects without specifying the exact class of object that will be created?
What is the default replication factor in HDFS?
Which of the following statements about Dijkstra’s algorithm is true?
What is the main advantage of using a linked list over an array?
Dynamic Programming is preferred over recursion when:
Which protocol is most commonly used for secure communication between IoT devices over the internet?
Which file structure is best suited for handling large datasets and ensuring fast access in C, C++, Java, or Python?
Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?
In a Windows computing environment, which of the following tools is used to monitor system performance and resource utilization in real-time?

Relevant for Exams:

Central Bank of India SO

Hey! Ask a query

ask-question