Re:Big O, Little N
by speakeron on Friday October 02, 2020 @05:54AM
(#24660851)
It's always worth remembering that O(n) describes the asymptotic limit where n is presumed to be very large (in fact, approaching infinity).
[ Parent
| on HN ]
Re:Big O, Little N
by MaxBarraclough on Friday October 02, 2020 @05:58AM
(#24660872)
Related 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