Last Lecture – December 7^th

We went over the above list of thinks to study and know for final

We discussed collision resolution methods and terminology some more

Showed examples of load factor

Talked about linear probing -

look for first available slot if hashed slot not vacant for placement

When searching look at hashed slot and if not found look sequentially until found or empty space

We talked about how to write the test programs to run the various sort programs

Modify the line of the specification that ends with returns Boolean; to returns Boolean <>;

This allows you to not have to worry about writing a function “<” or including it as a parameter in the instantiation

We also modified the sorts – eliminating the pragma.

We ran the merge_sort and the quick_sort

We went over the quicksort example on page 791