Question 10839 – APPSC-2016-DL-CS
March 14, 2024Question 10808 – APPSC-2016-DL-CS
March 14, 2024Question 10834 – APPSC-2016-DL-CS
Time complexity of an algorithm whose recurrence equation is T(n)=4T(n/2)+n2 and T(1)=1 is expressed as ______
Correct Answer: B
Question 32 Explanation:
O(n2)
O(n2 log n)
O(n3)
O(n log n)