News for hackers. Stuff that matters.
Re:Hardening Perl's Hash Function by andreasvc on Monday November 18, 2013 @05:26PM (#6757619)
I reckon because pointer-based trees are very slow compared to array-based data structures; these are constant factors due to memory accesses so they have nothing to do with the average and worst case performance you mention. For databases b-trees are appropriate, but for most uses of associative data structures hash tables are just very hard to beat.

There are no comments on this comment yet.