News for hackers. Stuff that matters.
Re:Everyday hassles in Go by nhaehnle on Tuesday December 30, 2014 @07:51AM (#8814354)
> For those who are bothered about the exponential algorithmic complexity of nub

There is nothing exponential about nub. Given only equality comparisons, detecting and eliminating duplicate elements requires quadratic running time.

Re:Everyday hassles in Go by friendly_chap on Tuesday December 30, 2014 @08:36AM (#8814515)
You are right! Others noted that mistake as well.