Re:Ask HN: I just wrote an O(N) diffing algorithm – what am ...
by hhmc on Tuesday October 29, 2019 @03:07PM
(#21390899)
But in the pathological case where all the inputs collide to the same hash, I don't see how you avoid degrading to at least O(N log N), even with resizing -- you must account for the resizing as an O( g(N) ) operation.
[ Parent
| on HN ]
There are no comments on this comment yet.