Blitsort: A fast, in-place stable hybrid merge/quick sort
Dumb questions from a programmer who is weak at math.<p>1) Is there a theoretical minimum assymptotic speed for sorting?<p>2) Some of these newer sorts seem to have arbitrary parameters in them (e.g. do X if size of set is smaller than Y). Are we likely to see more and more complex rule sets like that lead to increased sorting speeds?