Computer Science · Algorithms
According to the Master Theorem, what is the asymptotic solution of the following recurrence relation? T(n) = T(2n3) + 1
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1θ(n3/2)
- 2θ(n log n)
- 3θ(log n)✓
- 4θ(n2)
Correct answer
θ(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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms