BioHackersNetComputationalComplexity about time
Some common O() notations about TimeComplexity
meaning |
example |
|
O(1) |
constant |
access element in array |
O(log(n)) |
logarithmic |
|
O(n) |
linear |
sequential search |
O(n log(n)) |
worse than linear, but not much worse |
|
O(n2) |
squar law |
selection and InsertionSort |
O(n3) |
cubic |
ultiplication of 2 n * n |
O(Cn) |
exponential |