snippet Tuesday 14 January 2020
In computer science, big O notation is used to classify the complexity of a algorithm.
An algorithm is a set of steps that are taken to get to solve a problem
o(n) - How long will it take to compute through every possibility. How long will an algorithm take worst case. O(o1) - Constant time O(log n) - Logarithmic O(n) - Linear O(n log n) - Linearithmic O(n^2) - Quadratic or Polynomial O(2^n) - Exponential O(n!) - Factorial