Question
The recurrence relation T(n) = 2T(n/2) + O(n) corresponds to which algorithm’s time complexity?
More Algorithms Questions
- Among Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, which algorithm has the best average-case time complexity?
- What is the worst-case time complexity of a linear search algorithm on an array of 'N' elements?
- What is the worst-case time complexity of QuickSort with a random pivot for sorting n distinct elements?
- In the context of inter-process communication (IPC), which of the following mechanisms is used to ensure that only one process accesses a resource at a tim...
- Which of the following Big Data processing models is based on the concept of continuous data flow processing?
- A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
- Which of the following sorting algorithms is a non-comparison-based sort?
- Which application layer protocol is used to retrieve emails from a remote server?
- For which problem is dynamic programming NOT generally an applicable technique because it lacks overlapping subproblems?
- What is the time complexity of searching in a balanced binary search tree?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
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)