Function Growth and Big-O Notation
One of the most important aspects of algorithms is how quickly they grow. The quicker the growth, the better. Here is a list of function types in order of their growth: Constant functions Logarithmic functions Linear functions Linearithmic functions Polynomial functions Exponential functions Big-O Notation is a way to describe the growth, complexity and performance […]
Read more "Function Growth and Big-O Notation"