What is recursion?
Download as PPTX, PDF0 likes44 views
Recursion is a programming technique where a function calls itself, which is exemplified by a recursive function to calculate factorials. The document discusses how this process utilizes stack memory to handle multiple calls and provide results. An example is given to illustrate the factorial calculation through recursive calls.
1 of 5
Download to read offline
More Related Content
What's hot (17)
More from AnuragSrivastava272 (13)
Ad
Recently uploaded (20)
PDF
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 - GLOBAL SUCCESS - CẢ NĂM - NĂM 2024 (VOCABULARY, ...Nguyen Thanh Tu CollectionPDF
LAW OF CONTRACT (5 YEAR LLB & UNITARY LLB )- MODULE - 1.& 2 - LEARN THROUGH P...APARNA T SHAIL KUMARBÀI TẬP BỔ TRỢ TIẾNG ANH 8 - GLOBAL SUCCESS - CẢ NĂM - NĂM 2024 (VOCABULARY, ...Nguyen Thanh Tu Collection
LAW OF CONTRACT (5 YEAR LLB & UNITARY LLB )- MODULE - 1.& 2 - LEARN THROUGH P...APARNA T SHAIL KUMAR
Ad
What is recursion?
- 2. The function that calls itself is called as recursive function and the technique is known as recursion. Example-: int sample() { sample(); //recursion }
- 5. Stack Memory if(3==0) X else res=3*fact(2); return res; fact(n==3) if(2==0) X else res=2*fact(1); return res; fact(n==2) if(1==0) X else res=1*fact(0); return res; fact(n==1) if(0==0) res=1 return res; fact(n==0) n=3,res; fact(3); Output:6 main() 1 12 6