Fricasse of Crow

In my last post I showed a 2-buffer merge sort that I thought was fast. In support of that claim I now offer this picture:

http://picasaweb.google.com/chris.keith/AcademicStuff#5335363116849662498

However, I did some more work with other sorts (and my professor changed his random number generator) and now I get this (be careful, the horizontal scale is different):

http://picasaweb.google.com/chris.keith/AcademicStuff#5335363118138126626

Note that both quicksorts beat my mergesort (thus I anticipate crow for dinner tonight).

Also note that the recursive quicksort is faster than the iterative one, which doesn't seem right. I just pulled that code off the web (and recoded it from C# to C++). Perhaps there's a better iterative one, but that's an investigation for the future.