Faster than qsort()?

I saw a link to Introspective Sorting over at Ruby Garden. According to the calculations, the author believes it's better than qsort(). Basically it is qsort(), except it switches to heapsort in worst-case scenarios for qsort(). Really interesting read.