Scribd
Upload
9 views1 page

Recursion Overview

Recursion is a programming technique where a function calls itself to solve problems by dividing them into smaller subproblems. It consists of a base case that stops the recursion and a recursive case that simplifies the input. Common applications include tree traversal, factorial calculations, and divide-and-conquer algorithms like merge sort.

Uploaded by

dogan.jonat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views1 page

Recursion Overview

Recursion is a programming technique where a function calls itself to solve problems by dividing them into smaller subproblems. It consists of a base case that stops the recursion and a recursive case that simplifies the input. Common applications include tree traversal, factorial calculations, and divide-and-conquer algorithms like merge sort.

Uploaded by

dogan.jonat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Recursion is a programming technique where a function calls itself to solve a problem by

breaking it down into smaller subproblems. Every recursive function has:

1.​ Base case – the condition that stops the recursion.​

2.​ Recursive case – the part where the function calls itself with a simpler or smaller input.​

It's often used in problems involving tree traversal, factorial calculation, or divide-and-conquer
algorithms like merge sort.

You might also like