Information on midterm exam
- Wednesday, March 11, in class
- Open book, notes
- Textbook chaps. 6-15
- Lecture notes
- Programming assignments
- Problem sets
Partial list of algorithms covered so far
| insertion sort | linear search |
selection sort | binary search |
| bubble sort | interpolation search |
shellsort | BSTs |
| pointer sorting | root insertion BSTs |
quicksort | 2-3-4 trees |
| mergesort | red-black trees |
heapsort | randomized BSTs |
| binomial queues | hashing |
binary quicksort | separate chaining |
| skip lists | splay trees |
polyphase merge | B-trees |
| distribution counting | linear probing |
MSD radix sort | double hashing |
| LSD radix sort | tries |
radix 3-way quicksort | digital search trees |
| batcher's mergesort | extendible hashing |
Three-way radix trie | Patricia |
Sample question
Give the result of alg X running on input Y