Question

What is the recurrence relation for the time complexity of standard Merge Sort?

A T(n) = T(n-1) + O(n)
B T(n) = 2T(n-1) + O(n)
C T(n) = T(n/2) + O(1)
D T(n) = 2T(n/2) + O(1)
E T(n) = 2T(n/2) + O(n)
Practice Next

Hey! Ask a query

🎓
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)