3 ms·
It's always worth remembering that O(n) describes the asymptotic limit where n is presumed to be very large (in fact, approaching infinity).
by speakeron 6y ago
It's always worth remembering that O(n) describes the asymptotic limit where n is presumed to be very large (in fact, approaching infinity).
- MaxBarraclough 6y agoRelated to this, there exist algorithms with impressive complexity-theoretic properties, but which are never useful in practice. They even have a cute name: https://en.wikipedia.org/wiki/Galactic_algorithm https://en.wikipedia.org/wiki/Galactic_algorithm