Evaluating the asymptotic performance of an algorithm does point out some principles which are useful in practice: for example, concentrate on that part of the code which takes the majority of time, and discount any part of the code which takes an asymptotically negligible part of time. Some of the techniques of asymptotic analysis are useful.
Furthermore, realize that they are used to classify the asymptotic "growth rate" of the running time, not the running time itself as propagated by your various answers and comments.
We are looking for general methods and methods for a significant subclass as well as methods that yield precise solutions and methods that provide (bounds on) asymptotic growth. This is supposed to become a reference question. Please post one answer per method and provide a general description as well as an illustrative example.
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?
Given below, there are some good solutions to find the closed form expression, which also give the asymptotic complexity. However, if you only need the asymptotic complexity, the analysis is simpler. Have a look here for a good explanation on finding asymptotic complexities, with a nice intuitive solution for your problem instance.
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....
Arrange in increasing order of asymptotic complexity Ask Question Asked 5 years, 6 months ago Modified 5 years, 6 months ago