Timeline for Execution time of an algorithm on faster computer?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2024 at 13:48 | comment | added | gnasher729 | Another lesson is that the bigger the problem size, the more important a smaller big-o becomes, also compared to a faster computer or micro-optimisation. | |
| Dec 15, 2024 at 20:16 | history | edited | gnasher729 | CC BY-SA 4.0 |
added 428 characters in body
|
| Dec 15, 2024 at 20:15 | comment | added | Alexander |
And to state the point explicitly: this exercise is driving home the point that for functions with ≥ O(n), you can try to throw more/faster hardware at the problem, but you get diminishing returns in performance. 10x the compute gets you <10x the performance.
|
|
| Dec 14, 2024 at 15:28 | history | answered | gnasher729 | CC BY-SA 4.0 |