codeintuition-logo
Learning PathBlogsPremiumLogin
codeintuition-logo

Hide Index

Recursion

0% completed

Introduction to memory model

Overview of program in memory
Understanding memory partitions
Exploring stack memory
Insights into heap memory
Static memory allocation
Delving into the code segment
Visualizing the complete picture

Nested functions

Introduction to nested functions
Function call mechanics
Scope of local variables
Recursive function calls
Understanding stack overflow

Stack frame

Understanding the stack frame structure
Understanding the stack pointer
Understanding the frame pointer
Storage of local variables
Storage of function parameters
Handling the return value
Managing the return address

Recursion

Understanding the problem
Exploring a possible solution
Key components of recursion
Understanding the recursion tree
Implementing recursive algorithms

Pattern: Direct recursion

Understanding direct recursion
Recursively calculate factorial

Pattern: Head recursion

Understanding head recursion
Recursively print numbers from 1 to N
Recursively reverse a stack

Pattern: Tail recursion

Understanding tail recursion
Recursively print numbers from N to 1
Recursively reverse a queue

Pattern: Tree recursion

Understanding tree recursion
Recursively find the Nth fibonacci number

Pattern: Multidimensional recursion

Understanding multidimensional recursion
Recursively calculate binomial coefficient

Pattern: Indirect recursion

Understanding indirect recursion
Recursively print number from 1 to N II

Assessments

Assessment 1
Assessment 2

Certificate

Certificate

Liking the course? Check our discounted plans to continue learning.

Subscribe now