Douglas Orr personal blog
Finding unique items: hash vs. sort
A while back, I was trying to speed up some code which finds unique items in a collection. For example, transforming "AABBADCAB" => "ABDC" . There are two ways to do this efficiently - one is based on sorting, the other based on hashing. So, which is faster? I couldn't find the answer, so I ran some experiments and…
- Points
- 137
- HN comments
- 81
- Submissions
- 1
- Cited by
- 0 commenters
Software EngineeringDatabases & Data2020
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Jan 7, 2020 | Finding unique items: hash vs. sort by douglasorr | 137 | 81 |
