What is dynamic programming in C++?

What is dynamic programming in C++?

Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is particularly useful for optimization problems.

Can you give me an example of a problem that can be solved using dynamic programming?

Sure! A classic example is the Fibonacci sequence. Instead of recalculating Fibonacci numbers multiple times, dynamic programming stores previously computed values to optimize the calculation.

How do I implement dynamic programming in C++?

You can implement dynamic programming in C++ using either a top-down approach with recursion and memoization or a bottom-up approach using iterative methods. Would you like to see code examples?

Yes, please provide a code example for the Fibonacci sequence using dynamic programming.

Here's a simple implementation using the bottom-up approach:

#include <iostream>
using namespace std;

int fibonacci(int n) {
    int fib[n + 1];
    fib[0] = 0;
    fib[1] = 1;
    for (int i = 2; i <= n; i++) {
        fib[i] = fib[i - 1] + fib[i - 2];
    }
    return fib[n];
}

int main() {
    int n = 10; // Example
    cout << "Fibonacci of " << n << " is " << fibonacci(n);
    return 0;
}

This code calculates the nth Fibonacci number efficiently.