When trying to characterize an algorithm’s efficiency in terms of execution time, independent of any particular program or computer, it is important to quantify the number of operations or steps that the algorithm will require. If each of these steps is considered to be a basic unit of computation, then the execution time for an algorithm can be expressed as the number of steps required to solve the problem. Deciding on an appropriate basic unit of computation can be a complicated problem and will depend on how the algorithm is implemented.
For more information please go to this address :-
1. http://interactivepython.org/runestone/static/pythonds/AlgorithmAnalysis/BigONotation.html
2.http://pages.cs.wisc.edu/~vernon/cs367/notes/3.COMPLEXITY.html
3. https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
No comments:
Post a Comment