What is o notation
Mathmaticall way of describing how a function generally behaves in relation to the input size, all functions have the same growth rate
Big o notation rules
If f(x) is a sum of several terms, the higher order term is kept and others are discarded If f(x) has a term that is product of serval factors, all constant are omitted
Constant o notation
O(1)
Logarithmic big o notation
O(log n)
Linder big o notation
O(n)
Log liner
O( n log n)
Quadratic big o notation
O(n^2)
Exponential big o notation
O(c^N)
Linked lists are good for
Adding/deleting in the front and middle
Vectors are good for access anywhere but bad for in other positionins other than the backa?