## techInterview Discussion |
||

A part of techInterview.org: answers to technical interview questions.
Your host: Michael Pryor |
can the following function be implemented without using recursion:
F(n)=max(n,(F(n/2)+F(n/3)+F(n/4))) F(0)=0 and n>=0 is a solution in lines of the fibonacci series dynamic programming solution possible where space complexity is o(1)? Any help will be appreciated.
http://www.carsinsurance4u.com/ low car insurance ppfe http://www.autosinsurancequotes4u.com/ state auto insurance 4161 http://www.carsinsurancecompanies.com/ cheap insurance ewat http://www.free-home-insurance-quotes.net/ homeowners insurance %)))
Friday, July 02, 2010 |

Powered by FogBugz