https://www.cs.princeton.edu/courses/archive/fall24/cos226/
Description. This course surveys the most important algorithms and data structures in use on computers today. Particular emphasis is given to algorithms for sorting, searching, and graphs. The course concentrates on developing implementations, understanding their performance characteristics, and estimating their potential effectiveness in applications.
| O(1) | Constant Time |
| O(log n) | Logarithmic Time |
| O(n) | Linear Time |
| O(n log n) | Linearithmic Time |
| O(n^2) | Quadratic Time |
| O(2^n) | Exponential Time |
| O(n!) | Factorial Time |