News for hackers. Stuff that matters.
Re:The true cost of linked lists by jonny_eh on Monday June 06, 2022 @01:56PM (#31643568)
It's still useful for comparing potential performance of algorithms with different O(x).

e.g. an O(n) algorithm will most likely outperform an O(n^2) algorithm, but two different O(n) algorithms can still perform quite differently.

But you're right, it's meant for comparing scaling.

There are no comments on this comment yet.