News for hackers. Stuff that matters.

A comment on B-Heap vs. Binary Heap (2010). Parent comment

Re:B-Heap vs. Binary Heap (2010) by gwern on Sunday April 21, 2013 @10:32PM (#5587435)
Cache-oblivious algorithms can be pretty wacky when you're used to not thinking about locality at all.

A mergesort can be understood by even a beginner after an hour or less in a language like Haskell. A funnelsort...? Well, I'll put it this way: even after reading the papers, I'm not sure how I would go about implementing it.

[ Parent | on HN ]
Re:B-Heap vs. Binary Heap (2010) by mtdewcmu on Monday April 22, 2013 @12:34AM (#5587788)
I glanced at the code files from the inventor. It doesn't look like the kind of algorithm you implement yourself.
[ Parent | on HN ]