Asymptotic complexity is an approximation of the edge case performance of an algorithm used to determine best and worst case scenarios.
Questions tagged [asymptotic-complexity]
796 questions
-8
votes
1 answer
Giving the Big O, Big Theta and Big Omega for a function
How can one give Big O, Big Theta or Big Omega for a function like
T(n) = n + 10*log n
Can someone please tell me how I can get the complexity for such a thing?
Sorin Cioban
- 2,237
- 6
- 30
- 36