Read section 1.1 to 1.4 (inclusive) Reference 1 - http://jeffe.cs.illinois.edu/teaching/algorithms/book/01-recursion.pdf. This will cover:
- Introduction to recurssion
- Simple recursion problem
- Tower of Hanoi
- Merge sort
Additional links for recurssion:
- https://www.geeksforgeeks.org/sort-a-stack-using-recursion/
- Catalan numbers (it is very frequently appearing pattern in world)https://en.wikipedia.org/wiki/Catalan_number
- http://www.cs.cornell.edu/courses/cs312/2004fa/lectures/lecture16.htm
- https://www.youtube.com/watch?v=Z0sovxyD7-Q
- Reference 1 (section 1.6)
- https://sites.cs.ucsb.edu/~suri/cs235/ClosestPair.pdf
- Refernce 2: http://jeffe.cs.illinois.edu/teaching/algorithms/book/03-dynprog.pdf Section 3.1 to 3.3 (inclusive)
- We can delve further into it as per your interest
Reference 3: http://jeffe.cs.illinois.edu/teaching/algorithms/book/04-greedy.pdf This deals with interesting problems like:
- Job scheduling
- Huffman Codes
Reference 4: http://jeffe.cs.illinois.edu/teaching/algorithms/book/05-graphs.pdf We will go through basic graph traversal and graph distance algos.