A Fibonacci sequence algorithm using Dynamic programming written in C.

fibd.c

#include <stdio.h>
#include <stdlib.h>

#define N 512

long long int CACHE[N] = { 0, 1 };

long long int fib(int n) {
  if (n > 0 && !CACHE[n])
    CACHE[n] = fib(n - 2) + fib(n - 1);
  return CACHE[n];
}

int main(int argc, char** argv) {
  int n;
  if (argc <= 1) {
    printf("Usage: %s <N>\n", argv[0]);
    return 400;
  }
  n = atoi(argv[1]);
  printf("The #%d term of Fibonacci is %lld\n", n, fib(n));
  return 0;
}