Recursive fibonacci

fib.cpp

#include <iostream>
using namespace std;

unsigned long long fib(int n)
{
    if (n < 2)
        return n;
    else
        return fib(n-1) + fib(n-2);
}

int main()
{
    for(int i=0;i<20;i++)
        cout<<fib(i)<<endl;
    return 0;
}

fib.rb

def fib(n)
  n < 2 ? n : fib(n-1) + fib(n-2)
end

20.times do |i|
  puts fib(i)
end