Re:Finding unique items: hash vs. sort
by jonstewart on Wednesday January 08, 2020 @07:51AM
(#21990915)
Agreed on use of std::unordered_map, but I appreciated that the depth this went to was a simple comparison between the two obvious STL approaches. I think you could probably speed things up tremendously via micro-optimization, but it’s arguably more useful to know which of these two approaches to use when writing the code for the first time than how to optimize it to the teeth.
[ Parent
| on HN ]
There are no comments on this comment yet.