Implementing Algorithms and Data Structures TODO:
TEST EVERYTHING
BST -> class add, remove, validate HEAP -> with sorts, add, remove, pop FIB HEAP UNION-THING (kyle) BINARYSEARCH MERGESORT QUICKSORT MY HASHTABLE INTERVAL SCHED KNAPSACK ALGOS... A* BFS Prims Dijkstras Network Flow DESIGN PATTERNS Jaccard Distance