Brian Levin's EEN 511 Project
Traveling Salesman for tractably-sized data sets
Knapsack Problem by dynamic programming
One very-fast sorting algorithm for comparisons(Merge Sort)
Merge Sort vs. Heap Sort timing comparison
Efficient Priority Queue using a Min-Heap
Efficient Priority Queue using a Min-Heap (non-web version)
Sort a linked list efficiently in O(NlogN) time
Rapid Data Access: Dictionary using disc-file hash table