This chart matches common Big-O notations with their names and relative performance ratings. Is illustrates how an algorithm’s efficiency worsens as its computational complexity grows.
| Notation | Name | Performance |
|---|---|---|
| O(1) | Constant | Excellent |
| O(log n) | Logarithmic | Good |
| O(n) | Linear | Fair |
| O(n log n) | Linearithmic | Bad |
| O(n^2) | Quadratic | Horrible |
| O(2^n) | Exponential | Horrible |
| O(n!) | Factorial | Horrible |
Leave a Reply