# complexity

* Algorithmic compleixty
  * How different algorithms (sequence of stesp to solve a problem) scales for different input sizes
  * How many steps does it take to complete
    * steps can be thought of as time (integer time)
* https://stackoverflow.com/questions/716597/array-or-list-in-java-which-is-faster
* https://www.freecodecamp.org/news/big-o-notation/

### Time complexity calculation

* https://stackoverflow.com/questions/3255/big-o-how-do-you-calculate-approximate-it
* https://justin.abrah.ms/computer-science/big-o-notation-explained.html
* https://adrianmejia.com/how-to-find-time-complexity-of-an-algorithm-code-big-o-notation/
* An intuitive introduction to algorithmic efficiency https://www.youtube.com/watch?v=u2iHB2vv3iE
* https://www.interviewcake.com/article/python/big-o-notation-time-and-space-complexity?
* https://developerinsider.co/big-o-notation-explained-with-examples/amp/

### curves

* http://science.slc.edu/\~jmarshall/courses/2002/spring/cs50/BigO/
