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 heap property is correct?
- A hash table using separate chaining has 10 slots and stores 15 elements, uniformly distributed across the slots. What is the average number of comparisons...
- Which of the following statements accurately describes the function of a Gantt Chart in project management?
- Which testing type evaluates internal code logic and control flow?
- Using the Lomuto partition scheme with the last element as the pivot, partition the array [8, 3, 7, 4, 9, 2, 5] . What is the final index (0-indexed) of th...
- A developer at a financial firm replaced a Binary Search Tree (BST) based search index with a Hash Table based index to improve lookup performance. After d...
- What is the primary goal of the OWASP Top 10 project?
- Which of the following is a primary feature of Mobile Computing?
- Which of the following best describes Abstraction in Object-Oriented Programming (OOP)?
- In CI/CD pipelines, which of the following is NOT a key benefit of Continuous Integration (CI)?
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)