Fibonacci

Parts 1 & 2

//
//  main.c
//  Fibonacci
//
//  Created by Shahin on 2015-03-11.
//  Copyright (c) 2015 98% Chimp. All rights reserved.
//


#include <stdio.h>

int recursiveValueFibonaci(int remainingSteps, int previousNumber, int previousPreviousNumber) {
    if (remainingSteps <= 0) return 0;
    printf("%d\n",previousPreviousNumber);
    recursiveValueFibonaci(remainingSteps - 1, previousPreviousNumber, previousNumber + previousPreviousNumber);
    return 0;
}

int main(int argc, const char * argv[]) {

# pragma mark - Iteration
    
//    int input, firstNumber = 0, secondNumber = 1, nextNumber, counter;
//    
//    printf("Enter the number of terms\n");
//    scanf("%d",&input);
//    
//    printf("First %d terms of Fibonacci series are :-\n",input);
//    
//    for ( counter = 0 ; counter < input ; counter++ )
//    {
//        if ( counter <= 1 )
//            nextNumber = counter;
//        else
//        {
//            nextNumber = firstNumber + secondNumber;
//            firstNumber = secondNumber;
//            secondNumber = nextNumber;
//        }
//        printf("%d\n",nextNumber);
//    }
    
# pragma mark - Recursion
    recursiveValueFibonaci(12, 1, 0);
    return 0;
}