3 ms·
O() is a notion of speed of growth, not measuring how large are constants.
by riku_iki 7y ago
O() is a notion of speed of growth, not measuring how large are constants.
- Chickenosaurus 7y agoRight, the critique is evaluating algorithms based solely on asymptotic time / space characteristics is insufficient. Constants can be significant if they are big enough.