wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

The solution to the recurrence

T(n)=4T(n)+log2n

A
log n. log log n
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
B
log n.log log n
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
log n
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
n.log2n
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is A log n. log log n
Option (d)
Converting the Recurrence to the given form and applying Master Theorem with case II.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Laws of Logarithm with Use
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon