Computer Science 410: Homework 4

Note: ALWAYS explain what you are doing. The more information you give us, the easier it is for us to give you partial credit.


Homework 2: Handed out: 2/25/99; Due: 3/4/99


Read Chapters 9-12


Section   Number   Points    Comments
9.1 		3 		5 		This is how you prove that Theta(n lg n) is a lower bound
                                                on the expected number of comparisons 
9.1		4 		5
9.2             2               4
9.3             2               8
9.3             3               5
10.3            1               6
10.3            3               3
10.3            9               7
11.2            2               5
11.2            5               4
12.2            4               6
12.3            1               2