More Diagrams
Follow for More
🪞 Recursion Kya Hai?
Recursion: Ek function jo khud ko baar-baar call karta hai, jab tak koi base case na mil jaye.
Har Recursion mein do part hote hain:
Examples:
Factorial (n!):
Har Recursion mein do part hote hain:
- Base Case: Jahan function ruk jata hai
- Recursive Case: Function khud ko call karta hai
Examples:
Factorial (n!):
factorial(n) = n × factorial(n-1), jab tak n=1 na ho jaye.
Saree wali Misal:
👗
Har baar Babita ji nayi saree pehenti hain (function call), base case tab aata hai jab wardrobe khali ho jata hai!
❤️
Har baar Jethalal pyar mein pad jate hain (recursion)… jab tak Babita ji mana nahi karti! (base case 🛑)
🔗 Recursion vs Loop: Factorial Calculator
🔍 Recursion vs Loop Takkar
| Aspect | 🔁 Loop | 🔄 Recursion |
|---|---|---|
| Kaise? | Har baar manually control (for/while) | Function khud ko call karta hai (self-calling) |
| Rukna | Condition false hone par rukta hai | Base case milne par rukta hai |
| Memory Use | Fixed, efficient hai | Har call ke liye alag stack frame— zyada memory use |
| Performance | Aam taur par faster | Deep calls ke liye slow ho sakta hai |
| Glamour Factor | Simple aur sidha | Stylish & elegant (lekin risky bhi!) |