I wanted to compute 80th term of the Fibonacci series. I wrote the rampant recursive function, int fib(int n){ return (1==n -- 2==n) ? 1: fib(n-1) + fib(n-2); } and waited for the result. I wait... and wait... and wait... With an 8GB RAM and an Intel i5 CPU, why is it taking so long? I terminated the process and tried computing the 40th term. It took about a second. I put a check and was shocked to find that the above recursive function was called 204,668,309 times while computing the 40th term. More than 200 ...
Read More
I wanted to compute 80th term of the Fibonacci series. I wrote the rampant recursive function, int fib(int n){ return (1==n -- 2==n) ? 1: fib(n-1) + fib(n-2); } and waited for the result. I wait... and wait... and wait... With an 8GB RAM and an Intel i5 CPU, why is it taking so long? I terminated the process and tried computing the 40th term. It took about a second. I put a check and was shocked to find that the above recursive function was called 204,668,309 times while computing the 40th term. More than 200 million times? Is it reporting function calls or scam of some government? The Dynamic Programming solution computes 100th Fibonacci term in less than fraction of a second, with a single function call, taking linear time and constant extra memory. A recursive solution, usually, neither pass all test cases in a coding competition, nor does it impress the interviewer in an interview of company like Google, Microsoft, etc. The most difficult questions asked in competitions and interviews, are from dynamic programming. This book takes Dynamic Programming head-on. It first explain the concepts with simple examples and then deep dives into complex DP problems.
Read Less
Add this copy of Dynamic Programming for Coding Interviews: a Bottom-Up to cart. $5.48, good condition, Sold by GoodwillVSB rated 5.0 out of 5 stars, ships from Oxnard, CA, UNITED STATES, published 2017 by Notion Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. The book is nice and 100% readable, but the book has visible wear which may include stains, scuffs, scratches, folded edges, sticker glue, torn on front page, highlighting, notes, and worn corners.
Add this copy of Dynamic Programming for Coding Interviews: a Bottom-Up to cart. $6.98, very good condition, Sold by HPB Inc. rated 4.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 2017 by Notion Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!
Add this copy of Dynamic Programming for Coding Interviews: a Bottom-Up to cart. $29.10, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2017 by Notion Press.
Add this copy of Dynamic Programming for Coding Interviews: a Bottom-Up to cart. $52.28, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2017 by Notion Press.
Add this copy of Dynamic Programming for Coding Interviews: a Bottom-Up to cart. $52.61, new condition, Sold by Just one more Chapter rated 4.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 2017 by Notion Press.
