In the pursuit of understanding algorithms and data structure, I will attempt to capture interesting algos from the web. Algorithms I find interesting are those that would dramatically speed up an approach to a traditional problem.

Algorithms:

1. Fibonacci Sequence - add dynamic programming to fast doubling
2. Factorials - requires fast process
3. nCr - add iterative approach to add better insight
4. Prime Factorization and Divisors (Sieve Algorithms)
5. Recursion_Madness: -directory will house quite a bit of recursion problems -https://codingbat.com/java select recursion1 and recursion2
6. Generalized Combinations (order does not matter) (not materialized at all) -with replacement -without replacement
7. Permutation (order does matter) (not materialized at all) -with replacement -without replacement