Rohan Hart <roh### [at] peacecom> wrote:
: I've added heap sort to the mix.

  Cool.
  I tried heap-sort as well, but for some reason it was extremely slow.
It was even slower then insertion sort in all cases.
  I decided that it should not be that slow and that I probably made some
bug in it, but didn't find it. Thus, I didn't include it in my test.
  It seems that I was right. I had some bug in there. Heap sort seems as
fast as it should.
  Thanks for the heap sort code.


-- 
main(i,_){for(_?--i,main(i+2,"FhhQHFIJD|FQTITFN]zRFHhhTBFHhhTBFysdB"[i]
):_;i&&_>1;printf("%s",_-70?_&1?"[]":" ":(_=0,"\n")),_/=2);} /*- Warp -*/

Post a reply to this message