/*********
 * To compile on akbar, either "make fib" or "gcc -g -msupersparc fib.c -o fib"
 *
 * Measuring performance: from unix, "time fib" gives elapsed time.
 * While running, "ps -l" gives virtual memory size in SZ parameter, in pages
 * (2 pages = 1k on sun system)
 *
 *********/


#include <stdio.h>		/* printf, scanf */

int main(){
  int nInput, nFib, i;
  int* nArray;

  printf(" Playing with the Fibonacci series. \n");

  printf("Recursive: N=? ");
  scanf("%d", &nInput); 
  nFib = recurFib(nInput);
  printf("Done.  Answer = %d \n\n", nFib);

  printf("Iterate and save: N=? ");
  scanf("%d", &nInput); 
  nArray = (int*)malloc( nInput*sizeof(int) );
  nArray[0]=1;
  nArray[1]=1;
  for (i=2; i<nInput; i++) {
    nArray[i] = nArray[i-1] + nArray[i-2];	    // nArray[n-1] = Fib(n)
  }
  nFib = nArray[nInput-1];
  printf("Done.  Answer = %d \n\n", nFib);

}

/* Recursive Fibonacci */
int recurFib(int n){
  if (n<2) {
    return(n);
  }
  else {
    return( recurFib(n-1) + recurFib(n-2) );
  }
}