GATE CS 2022: Algorithm 4 (App update required to attempt this test)
Attempt now to get your rank among 264 students!
T(1) = 0
T(n) = O(n log n)
T(n) = θ (log n)
What is the time complexity of above recurrence relation?
Among the following sequences:
How many are the depth first traversals of the above graph?
- 264 attempts
- 0 upvotes
- 0 comments