I want to know difference between recursive function and using a stack in terms of use of memory usage.
Say for large DFS which will be more efficient.
I want to know difference between recursive function and using a stack in terms
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I want to know difference between recursive function and using a stack in terms of use of memory usage.
Say for large DFS which will be more efficient.
An explicit stack data structure should use slightly less memory in theory, as a recursive function will always have some additional overhead per invocation, for return address, etc.