1 nota · última: 26 Aug 2020
The post defines Big O Notation as a way to classify algorithms by runtime and space use, then compares constant and linear examples and introduces logarithmic growth.