Quiz 2 topics:

• Sorting - all sorting algorithms covered so far and their runtimes.
  • Be able to demonstrate a particular sorting algorithm (so the sorting problems from the homework).
  • Analyze or prove stability for a given sorting algorithm.
  • What must you consider when choosing a sorting algorithm to use.
• Hash table -
  • Hashing values
  • what makes good hash functions and bad hash functions
  • what are good/bad table sizes
  • collision techniques - seperate chaining, linear probing, quadratic probing, and double hashing.
  • hashing examples - take a set of numbers and hash them using some collision resolution technique