//---------------------------------------------------------------
//---------------------------------------------------------------
//
// r4.cpp
//
// An example of a recursive function: fibonacci
//
// Written by: Simon Parsons
// Date: 28th November 2007
//

#include <iostream>
using namespace std;

int fibonacci (int n) {
  if (n == 0){
    return 0;
  }
  else
    if (n == 1){
      return 1;
    }
    else {
      return(fibonacci(n - 1) + fibonacci(n -2));
    }
} // end of fibonacci()


int main() {
  cout << "The sixth fibonacci number is = " << fibonacci(6) << endl;
}