Question
Merge Sort on an array of size n satisfies the recurrence relation T(n) = 2T(n/2) + O(n). What is the resulting worst-case time complexity of Merge Sort?
More Data Structure Questions
- Which of the following is a key challenge in handling deadlocks in an operating system?
- Which of the following is a key advantage of digital signatures?
- Union-Find with path compression achieves nearly constant time because its complexity is:
- Which I/O scheduling algorithm is most suitable for minimizing seek time in hard drives?
- What is "unit testing" and how does it relate to debugging?
- During insertion into an AVL tree, a node becomes unbalanced with a balance factor of -2, and the newly inserted node lies within the right subtree of that...
- Which CPU scheduling algorithm always selects the process with the smallest burst time first, potentially leading to starvation?
- Hashing is used for:
- Which of the following best represents the main objective of the Requirements Analysis phase in the Software Development Lifecycle (SDLC)?
- Which of the following is true about triggers in a relational database?
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)