Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Which one of the following correctly determines the solution of the recurrence relation with
T(1) = 1?
\(T\left( n \right) = 2T\left( {\frac{n}{2}} \right) + \log n\)
1
Θ(n)
2
Θ(n log n)
3
Θ (n2)
4
Θ(log n)
5
Question Not Attempted