EECS 560: Data Structures
The Documents:
  Project 1--Four Seasons of Hash Tables: Open, Linear, Double and Quadratic Hashing (doc) (pdf) (raw data xls)
  Description--Implemented 4 types of hash tables in c++ and performed timing analysis culminating in this report.

  Project 2--Analysis of Priority Queues: Binary Search Tree, Min-Max Heap, Leftist Heap (doc) (pdf) (raw data xls)
  Description--Implemented 3 types of priority queues in c++ and performed timing analysis on them.

  Project 3--Minimum Spanning Tree Algorithms (doc) (pdf)
  (raw data xls)
  Description--Implemented multiple variations of Prim's and Kruskal's MST algorithms in c++ and performend extensive timing analysis.

Note: I am very proud of the fact that my algorithms for Project 3 absolutely smoked the rest of the class in terms of speed.  I could run 15k nodes(vertices) with 40k edges in under a minute when they could only run 100 nodes with a couple hundred edges in literally 3+ hours.  There was not even any competition.  I had a highly optimized pointer structure that allowed me to avoid much of the searching that their algorithms were having to due at each iteration.