Algorithm analysis – part 01
Your first 7 steps.
01 - Algorithm analysis: how do you do it?
Learn how to do algorithm analysis. See examples and step-by-step demonstrations of analyzes performed on real algorithms.
Read post
02 - Best case and worst case
Learn in this article how some specific constructions can define different complexity functions for the same algorithm. Defining the concepts of best case and worst case.
Read post
03 - Asymptotic behavior
Deepen your knowledge in algorithm analysis. Know the importance of asymptotic behavior of the functions generated by the analysis process.
Read post
04 - Asymptotic classes
Continue to deepen your knowledge of algorithm analysis. Learn about asymptotic classes and the differences in performance between them.
Read post
05 - Big O notation
Learn the full details of the Big O notation: the first of the top 3 notations used in algorithm analysis to represent performance.
Read post
06 - Big Omega notation
Learn the full details of the Big Omega notation: the second of the top 3 notations used in algorithm analysis to represent performance.
Read post
07 - Theta notation
Learn all the details of Theta notation: the last of the top 3 notations used in algorithm analysis to represent performance.
Read post