You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
notes/classes/algorithms/big_o_notation.md

991 B

Big O Notation

from algorithms

Big O notation is a system that allows you to estimate the amount of time the average algorithm will take, there are about 6 useful values that an algorithm will fall into

Complexity Name Tractibility
O(1) constant Tractable
O(log(n)) Logarithmic Tractable
O(n) Linear Tractable
O(nlog(n)) Linearithmic Tractable
O(n^k) Polynomial Tractable
O(b^n) Exponential (b>1) Intractible
O(n!) Factorial Intractible

the number of times you are going through an operation is irrelevant, so for example if you have an operation that is O(n), but you do it more than once, it is still represented as O(n)

measuring_combinations_of_functions

see also

list without id file.inlinks
where file.name = this.file.name