Computer Science · Analysis of Algorithms
The tight asymptotic bound for the recurrence T(n) = 2T(n / 4) + √n is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Θ(n log √n)
- 2Θ(√n log n)✓
- 3Θ(n log n)
- 4Θ(√n)
Correct answer
Θ(√n log n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Analysis of Algorithms MCQs →Want more practice questions on Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Analysis of Algorithms