Question
The Merge Sort algorithm 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
- What is the worst-case time complexity of Quick Sort?
- What will be the output of the following code: class Parent { static void display() { System.out.println("Parent"); } } class Child ...
- In the context of page replacement algorithms, which one minimizes page faults in an ideal scenario?
- Given the IP address 192.168.10.5 and the subnet mask 255.255.255.240 , what is the range of valid host addresses in this subnet?
- Which of the following statements about normalization in relational databases is correct?
- An array of 10 distinct elements is sorted using Quicksort, and the pivot chosen at every step happens to always be the smallest element in the current sub...
- Which statement correctly explains why Dijkstra's algorithm produces incorrect shortest-path results on graphs containing negative edge weights, even when ...
- A hash table of size 7 uses h(k) = k mod 7 with linear probing for collision resolution. Keys 10, 3, 17, and 5 are inserted in that order. At which index d...
- What is the time complexity of the naive recursive algorithm that computes the n-th Fibonacci number using the relation fib(n) = fib(n-1) + fib(n-2), witho...
- A code flow involves processing a stream of data where elements are added to the front and removed from the front. Which type of linked list would provide ...
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)