View All num of num See all Photos Amazon.com www.amazon.com Engaged Employer Overview Reviews Salaries Interviews Jobs Photos Benefits 4.6k Reviews 11k Salaries 6.0k Interviews 10k Jobs Follow Add Interview Follow Add Interview Interview Question Software Development Engineer Intern Interview Seattle, WA Amazon.com Describe how recursion isn't always efficient. Tags: See more , See less 8 Answer Add Tags Answer Interview Answer 3 Answers ▲ 1 ▼ Stack frames consume memory by having local variables in each frame stored. Also asked what can be contained in the stack frame (such as local variables - mem addr and return addr). Interview Candidate on Jan 23, 2014 ▲ 0 ▼ Stackoverflow problem when recursion is deep but can be solved by tail recursion Anonymous on Jan 29, 2014 ▲ 0 ▼ In certain problems such as Fibonacci, sub-problems are computed more than once with recursive method. It would be more efficient with dynamic programming. Yidan on Feb 24, 2014 Interviews > Software Development Engineer Intern > Amazon.com Add Answers or Comments To comment on this, Sign In or Sign Up.