Scribd
Upload
5 views79 pages

Recursion Notes

The document discusses recursion as a method for solving computational problems by breaking them down into smaller instances. It provides examples of recursive functions, including printing numbers in decreasing and increasing order, calculating factorials, and finding Fibonacci numbers. Additionally, it covers various problems such as checking if an array is sorted, finding occurrences of elements, and generating binary strings without consecutive ones.

Uploaded by

saxenajimeerut
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
5 views79 pages

Recursion Notes

The document discusses recursion as a method for solving computational problems by breaking them down into smaller instances. It provides examples of recursive functions, including printing numbers in decreasing and increasing order, calculating factorials, and finding Fibonacci numbers. Additionally, it covers various problems such as checking if an array is sorted, finding occurrences of elements, and generating binary strings without consecutive ones.

Uploaded by

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

You might also like