News for hackers. Stuff that matters.
Re:The xkcd survey by brianwawok on Wednesday September 02, 2015 @01:53PM (#10160898)
Exactly he does an O(N^2) Pair followed by a later O(N) search.

Why not do a O(1) Pair folloed by an O(1) Search.

Re:The xkcd survey by djfm on Wednesday September 02, 2015 @04:15PM (#10161650)
Intuitively I'd say a human pairing socks is far better than O(n2) because finding something that matches a given sock is close to O(1) on small sets.
Re:The xkcd survey by dtparr on Wednesday September 02, 2015 @02:42PM (#10161189)
Of course, there's an enlightening stackoverflow question on this: http://stackoverflow.com/q/14415881/220347

Finally, my graduate-level algorithms class comes in handy in real life.