I reread the two sections about insertion sort and selection sort in TAOCP. Those are two very good sections on this seeminly simple subject. In fact, I should regard I understand these broad types of sorting technique *after* I finished the exercises in TAOCP first.
One thing I learn is that insertion sort's performance is actually related the average number of inversion in a sequence. This gives a better insight than the standard probablistic arguments.
Very interesting. There are just so many things I don't know even in "simple" matters.
33_P
No comments:
Post a Comment