tags: cs-374 algorithms
Runtime
Runtime describes how long an [algorithm] takes to run. The most common way of ranking different algorithms for the same problem is by how quickly they run.
- ideally, we want the fastest possible algorithm for any particular problem
- in application settings, it is acceptable for programs to run efficiently most of the time, on all "reasonable" inputs
- in theory, it's often required that algorithms always run efficiently, even in the worst case
Runtime is measured using Big-O notation.
TODO: take more notes