Timeline for Algorithm Analysis: In practice, do coefficients of higher order terms matter?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2014 at 16:31 | review | First posts | |||
| Dec 23, 2014 at 16:34 | |||||
| Dec 1, 2014 at 4:39 | comment | added | raptortech97 | Counterpoint: yes, but not all steps are equal, even from machine to machine. An operation might take 5 cycles on one CPU and just one on another. Caches are also critical, and often an algorithm that uses a linked list will be slower than an array-based program, even if it uses half the operations. | |
| Dec 1, 2014 at 4:32 | history | answered | Vinay Emani | CC BY-SA 3.0 |