READ: Algo-complexity

Qingqi@2020-07-20 #read

time complexity and space complexity
python, 'timeit' package
Big(O) Notation

function	Big(O) notation	note
constant	$O(c)$	alsways need fixed steps
linear	$O(n)$	input = steps
logarithmic	$O(log(n))$
quadratic	$O(n^2)$
cubic	$O(n^3)$
exponential	$O(2^n)$

we generally refer to worst case complexity

Comments

Log in to add your comment

Don't have an account? register here