Please discuss dynamic programming, greedy, and iterative improvement algorithm design technique with an example (do not use same example used by your peers). Also, compare and contrast these...

Dynamic programming is one of the powerful algorithm technique to solve a different problems of class. In dynamic programming, problem is divided into small sub parts. After solving every sub problem, dynamic programming together all the solutions in order to retrieve great outcome. The example of dynamic programming is Recursive algorithm for Fibonacci Series as shown below:
/*******Example of Dynamic programming in c++******************/
#include

int rec_fib(int x)
{
  /* an array is declared to save Fibonacci numbers. */
  int r[x+2];
  int m;

  r[0] = 0;
  r[1] = 1;

  for (m = 2; m <= n; m++)
  {

      f[m] = f[m-1] + f[m-2];
  }...