https://cs.slides.com/colt_steele/big-o-notation

https://cs.slides.com/colt_steele/built-in-data-structures-25

https://rithmschool.github.io/function-timer-demo/ - playground

Things to be known before Big 0

Introducing— Big 0

• To analyze the performance of an algorithm, we use Big O Notation ( the size of the input grows we gona know how runtime changes or how space changes)
• Big O Notation can give us a high level understanding of the time or space complexity of an algorithm
• Big O Notation doesn’t care about precision, only about general trends (linear? Quadratic? Constant?)
• The time or space complexity (as measured by Big O ) depends only on the algorithm, not the hardware used to run the algorithm