###Goal:
#####To futher understanding of complex algorithms in how to formulate them, proove their correctness, and analyze their time and space efficiencies.
Course Material: Reference Slides
- Greedy
- String Sorting
- Tries
- Data Compression
- Complete Search
- Divide and Conquer
- Dynamic Programming
- Network Flow
- P, NP, and NP-Complete
Press on the name to go to the problem descriptions or click "here" to go directly to project folder in this repository.
1. Turtle Graphics and Anagrams | click here
2. Burrows-Wheeler Compression | click here
4. Book 5.3 and 4.12 | click here
The book that I refer to is Algorithm Design by Jon Kleinberg and Eva Tardos