Timeline for "For small values of n, O(n) can be treated as if it's O(1)"
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2014 at 4:34 | comment | added | Gordon Gustafson |
From a purely mathematical standpoint, asymptotic complexity tells you nothing when n < infinity.
|
|
| Dec 18, 2014 at 18:40 | comment | added | Evorlor | Great metaphor! | |
| Dec 17, 2014 at 17:12 | comment | added | Raphael | "For small n, use whatever's convenient." -- if you execute the operation often, pick the fastest (for your $n$). See also here. | |
| Dec 16, 2014 at 20:48 | review | First posts | |||
| Dec 16, 2014 at 20:59 | |||||
| Dec 16, 2014 at 20:47 | history | answered | Eric Hughes | CC BY-SA 3.0 |