Recursion Basics

 

• The function currently being executeed is on the top of the stack
• I answer to function which called me

Step 1. FAITH

• k wali value
• jiske lea humne maan liya kaam krega
• jiske lea yeh equation hold true krege
• jiske lea humein answer mil jaega

Step 2. EXPECTATION

• k+1 hold true krege

Step 3. WORK

• k ko kese use krenge ki (k+1) wali EXPECTATION ko FAITH se meet kr denge

Step 4. BASE CASE: i.e. rukna kha pr hai

Print 5 to 1

FAITH f(5)

EXPECTATION = f(4) will give 4, 3, 2, 1

f(n) = {

    BASE CASE: if (n == 0) return;

    WORK: Sout(n)

    FAITH: f (n-1)

}