Output 13 কেন? 🤯 | Two-Variable Recursion Trick | C Challenge (17/100)

Описание: Output 13 কেন? 🤯 (Day 17/100)
Two-Variable Recursion-এর এই Tricky Logic-টি বুঝুন!

(In this video, we trace a recursive function with two parameters: x and y.)

✅ Key Concept: Recursion Tree with Multiple Variables
Function: `f(x, y)`
Base Case: `if (x == 0) return y;`
Recursive Call: `return f(x-1, x+y);`

*Trace for `f(4, 3)`:*
1. `f(4, 3)` calls `f(3, 7)` - (x decreases, y increases by x)
2. `f(3, 7)` calls `f(2, 10)` - (3+7=10)
3. `f(2, 10)` calls `f(1, 12)` - (2+10=12)
4. `f(1, 12)` calls `f(0, 13)` - (1+12=13)
5. `f(0, 13)` - Base Case! Returns **13**.

Final Output: *13*

GATE, JECA, & Interview-এর জন্য এই ধরনের Recursion Problem খুব গুরুত্বপূর্ণ!

#cprogramming #cprogramminginbengali #clanguage #recursion #gate #jeca #computerscience #bengali #coding #programming #bitlearner #shorts