Binomial heap: Merge algorithm added
added function definition for binomial heap merge.
Added Big-O analysis for binomial heap merging.
Binomial heap | pop | remove tree finished.
Binomial Heap | delete Min | Algorithm OK.
Functional Binomial Heap part is finished. next is to add imperative part to finish this section.
Imperative insertion algorithm finished. next is to add imperative merge algorithms.
Place-holder for subset sum problem.
subset sum program, still contains bug.
Subset sum, python program is OK.
Subset sum: Brute force Haskell program is refined.
Binomial Heap: Finished merge part, next is to add imperative part for pop.
Finished binomial heap part.
Fibonacci heap: stop at definition section.
Fibonacci heap: stop at merge part.
Binomial heap: FP merge, insert, and top are drafted. next is pop algorithm.
Fibonacci heap FP part is finished. next is to given the proof and provide imperative part.
Haskell binomial heap program: rename removeMinT to extractMin; and fixed some typos in latex manuscript.
Fib Heap: Added the subsection about decreasing key, and start writing the running time analysis.
Fib Heap: added amortized analysis for pop, next is to add imperative decrease key part.