engineering recuitment GATE CSE 2023-24 Test Series Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
What will be the time complexity for the following recurrence relation?
T(n)=8T(n1/2)+(log n)2 if n>2
= 1,Otherwise
1
Θ((log n)3)
2
Θ(n2)
3
Θ(n log n)
4
Θ((log n)4)