Re:The true cost of linked lists
by sly010 on Monday June 06, 2022 @12:58PM
(#31642899)
And similarly, very few algorithms are better than O(n), because something as simple as adding 2 numbers can be O(n) where n is the size of the number in bits :)
[ Parent
| on HN ]
There are no comments on this comment yet.