Date: 2019-10-24

Big-O Name Description
O(1) constant The best.
O(log n) logarithmic Pretty great.
O(n) linear Good performance.
O(n log n) linearithmic
O(n^2) quadratic Slow.
O(n^3) cubic Poor performance.
O(2^n) exponential Very poor performance.
O(n!) factorial Intorably slow.