fibonacci

I was interested in comparing ruby speed vs python so I took the simplest recursive calculation, namely print the fibonacci sequance. This is the python code #!/usr/bin/python2.7 def fib(n): if n == 0: return 0 elif n == 1: return 1 else: return fib(n-1)+fib(n-2) i = 0 while i < 35: print fib(i) i = i + 1 and here is the ruby code #!/usr/bin/ruby def fib(n) if n == 0 return 0 elsif n == 1 return 1 else fib(n-1)+fib(n-2) end end i = 0 while (i < 35) puts fib(i) i = i + 1 end over several runs, time reports this average real 0m4.782s user 0m4.763s sys 0m0.010s thats for ruby, now python2.7 gives

I'm trying to find the sum of the Fibonacci sequence in Java, but the run time is taking way too long (or is it suppose to?). This slows down anytime I use an integer past 40. Note: At 50, a negative value is returned which boggles my mind. Any advice? public static void main(String[] args) { //Find Fibonacci sequence int sum=getSum(50); System.out.println("Sum of Fibonacci Numbers is " + sum); } static int getSum(int n){ if (n==0) return 0; if (n==1 || n==2) return 1; else return getSum(n-1) + getSum(n-2); } For n > 2 , an invocation of your getSum(n) recursively invokes itself twice. Each of

function fibo() { var first,second,add; for(var i=0;i<4000;i++){ if(i === 0){ first = 1; second = 2; } add = first + second; first = second; second = add; } alert(add); } fibo(); not working shows infinity why? Simple: because it's too big. The 300th term is 222232244629420445529739893461909967206666939096499764990979600, so you might imagine how big the 4000th is. You can't hold such value in a JavaScript variable. If you really want to calculate it, use an arbitrary precision library, and maybe something other than JavaScript if you want to calculate it fast. Check GNU Multiple Precision