Re:The true cost of linked lists
by erk__ on Monday June 06, 2022 @10:08AM
(#31640695)
That is probably a reason big-O is used, the big-O definition which says that they most be upper-bounded by a linear multiplier. So even if the second and third multiplication is faster it will not change the asymptotic behavior.
[ Parent
| on HN ]
There are no comments on this comment yet.