engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
\What is the asymptotic value for the recurrence equation T(n) = 2T(n/2) + n?
1
O(n)
2
O(n2)
3
O(n2 log n)
4
O(n log n)