What is an asymptotically tight upper bound? From what I have learned asymptotically tight bound means that it is bound from above and below as in theta notation But what does asymptotically tight upper bound mean for Big-O notation?
Explaining the relevance of asymptotic complexity of algorithms to . . . In short asymptotic complexity is a relatively easy to compute approximation of actual complexity of algorithms for simple basic tasks (problems in a algorithms textbook) As we build more complicated programs the performance requirements change and become more complicated and asymptotic analysis may not be as useful
Confusion about asymptotic notations in math and computer science The last times i was searching a lot to understanding Big O notation or in general asymptotic notations concepts because i didnt hear about it or them before starting studying in computer science