Learning out come will be
*Understand asymptotic annotations
*Understand comparison sort
*Understand hash function
Assignment 1: Show that quicksort's best-case running time is Ω (n lgn).
Assignment 2: Show how to sort n integers in the range of 0 to n2- 1 in O(n) time.
Assignment 3: Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table of length m = 11 using open addressing with the primary hash function h'(k) = k mod m.
Illustrate the result of inserting these keys using 1) linear probing and using 2)
double hashing with h2(k) = 1 + ( k mode (m-1) )