|
|
|
|
|
by InclinedPlane
4823 days ago
|
|
It's funny, many coders are smart enough to figure out that the solution to an O(n^2) algorithm is typically not more CPU cycles but changing to an O(n*log n) algorithm (or what-have-you). Yet they often refuse to make the same observations when it comes to their own productivity, they just throw more cycles at the same algorithms and expect that to be the optimal solution. |
|
Scaling is just a large value of n.