【正文】
time! ? Where’s the fallacy? Answer: ? Comparison sorting takes Ω(n lg n) time. ? Counting sort is not a parison sort. ? In fact, not a single parison between elements occurs! Radix sort ? Origin: Herman Hollerith’s cardsorting machine for the 1890 . Census. (See Appendix .) ? Digitbydigit sort. ? Hollerith’s original (bad) idea: sort on mostsignificant digit first. ? Good idea: Sort on leastsignificant digit first with auxiliary stable sort. Bucket sort Assumption: The input is drawn from a uniform distribution. Idea Algorithm Correctness Analysis Analysis Analysis Analysis Analysis Conclusion