JB TAK FODEGA NHI .... TB TK CHODEGA NHI .... (MAANG)

L5 Multiple Recursion Calls

Mulitple Recursion calls that means more than one recursion call at a single time that know as multiple Recursion call at a time.
This Concept is Vaey Important fro the

Dynamic Programming

N queen Solver etc..

Example: Phebonachi Number We Called the 2 Function at the Same Time

                    fun(n-1)+fun(n-2)
                 

Always Remember if Multiple Recursion do then first complete and then second exicuited

Recursion Tree

Notes

Note: Zoom for Better Understanding

Code Zone!

Time Complexity:O(2 ^ N) Exponential Time Becouse we used the Recursion Concepts
Space Complexity:O(N) O(N) for the Recursive Stack Space.