Big O Notation

bigO.txt

This is a way to measure the complexity of an algorithim (i.e the runtime). These measurement is usually done based on Space and Time.

O(1) - Constant             |
O(n) - Linear               |
O(log n) - Logrithmic       | Best to Worst
O(n log n) - Linearithmic   |
O(n ^ 2) - Exponential      |
O(n!) - Factorial           V

Op
 |
 |               O(1)
 |----------------------------------------------
 |
 |
 |
 |
 |
 |
 |
 |
 |
  ==============================================
                                               El
                                               
Op - Operations
El - Elements

Rules when calculating the Big O (runtime) of an algorithim
============================================

- Drop constants