News for hackers. Stuff that matters.

A comment on Removing Array Duplicates. Parent comment

Re:Removing Array Duplicates by saagarjha on Friday April 12, 2019 @04:13AM (#19642987)
It requires a single linear pass instead of a convoluted sort.
[ Parent | on HN ]
Re:Removing Array Duplicates by roel_v on Friday April 12, 2019 @04:38AM (#19643107)
... what sort? Are talking about the same thing here?
[ Parent | on HN ]
Re:Removing Array Duplicates by saagarjha on Friday April 12, 2019 @04:49AM (#19643159)
The code in the article has a sort in it.
[ Parent | on HN ]
Re:Removing Array Duplicates by KirinDave on Friday April 12, 2019 @05:19PM (#19649112)
Why would that be "more copies" than building up a hash table is what I don't get.
[ Parent | on HN ]
Re:Removing Array Duplicates by bjoli on Wednesday April 17, 2019 @05:12PM (#19686526)
It requires many passes through the list, and even O(LogN) is probably enough to make it slower than a hash based O(n) approach depending on list size. Hashing is fast. If space is an issue, just use an appropriately sized bloom filter.
[ Parent | on HN ]