Lecture 2:

Calculate the table and frecuency and probabilty graphs of t(5) for insertion sort of n=5 [t(4) is in Isortn4.xls]
Applet for average time estimation of Insertion Sort on random permutations without repetitions for "big" n's (n > 15).
Applet for average time calculation of Insertion Sort when input is a uniform random permutation with repetitions for (n<10)
Applet for average time estimation of Insertion Sort on random permutations with repetitions for "big" n's (n > 10).
Find the average time formula for Insertion Sort when input is a uniform random permutation with repetitions.
Modfiy the animation applet InsertionSortAnim for one of the following: Min Sort, Bubble Sort or Binary Seach.