In dynamic programming, what approach is commonly used to efficiently compute Fibonacci numbers?

  • Bottom-up approach
  • Divide and conquer approach
  • Greedy approach
  • Top-down approach
The bottom-up approach is commonly used in dynamic programming to efficiently compute Fibonacci numbers. It involves solving smaller subproblems first and using their solutions to build up to the solution of the original problem, often utilizing an array or table to store intermediate results.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *