This course on recursion in programming aims to teach learners the principles and applications of recursion. By the end of the course, students will understand what recursion is, when to use it, and how it can be applied to various data structures and algorithms. The course covers topics such as string manipulation, number operations, divide and conquer algorithms, linked lists, trees, graphs, and recursion optimizations like memoization and tail-call recursion. The teaching method includes explanations, animations, code demonstrations, and debugging sessions. This course is suitable for individuals interested in advancing their programming skills and understanding the concept of recursion, regardless of their programming language background.
Overview
Syllabus
) Introduction.
) What Is Recursion?.
) Explaining Recursion via ATM Analogy.
) Explaining Recursion via Essay Revision Analogy.
) Summarizing What Recursion Is.
) Why & Why Not Recursion.
) Understanding The Call Stack.
) Call Stack Analogy.
) Recursion With Strings Introduction.
) String Reversal Explanation.
) String Reversal Call Stack Animation.
) Palindrome Explanation.
) Palindrome Call Stack Animation.
) Recursion With Numbers.
) Decimal To Binary Explanation.
) Decimal To Binary Code & Debug.
) Sum of Natural Numbers Explanation.
) Sum of Natural Numbers Code & Debug.
) Divide & Conquer Algorithms.
) Binary Search Animation & Explanation.
) Fibonacci Explanation.
) Fibonacci Animation.
) Merge Sort Explanation & Animation.
) Merge Sort Code & Debug.
) Linked Lists.
) Linked List Reversal Animation.
) Linked List Code & Debug.
) Merge Two Sorted Linked Lists Animation.
) Merge Two Sorted Linked Lists Code & Debug.
) Trees.
) Insert Value Into Binary Search Tree Animation.
) Insert Value Into Binary Search Tree Code Walkthrough.
) Insert Value Into Binary Search Tree Call Stack Animation.
) Print All Leaf Nodes Explanation.
) Print All Leaf Nodes Code & Debug.
) Graphs.
) Depth-First Search Animation.
) Depth-First Search Code Walkthrough.
) Recursion Optimizations.
) Memoization & Caching.
) Tail-Call Recursion.
) Conclusion.
Taught by
freeCodeCamp.org
