Java/JavaScript/C/Python递归方法实现斐波那契数列耗时对比

public class Fibonacci {
    public static void main(String[] args){
        long start = System.currentTimeMillis();
        System.out.println(fibonacci(50));
        System.out.println(System.currentTimeMillis() - start);
    }

    public static long fibonacci(int n){
        if (n <= 1){
            return n;
        }
        return fibonacci(n-1) + fibonacci(n-2);
    }
}

#include <stdio.h>
#include <time.h>

long long fibonacci(int n);
long long fibonacci(int n) 
{
    if (n <= 1){
            return n;
        }
    return fibonacci(n-1) + fibonacci(n-2);
}

int main ()
{
    clock_t       start,   finish;   
    double       elapsed_time;
    start=clock();
    printf("%lld \n", fibonacci(50));
    finish = clock();   
    printf("%d \n", finish);
    return 0;
}

start = new Date().getTime();

function fibonacci(n){
    if (n <= 1){
        return n;
    }
    return fibonacci(n-1) + fibonacci(n-2);
}

console.log(fibonacci(50))
console.log(new Date().getTime() - start);

import time


start = time.time()
def fibonacci(n):
  if n <= 1:
    return n
  return fibonacci(n-1) + fibonacci(n-2)

print(fibonacci(50))  
print(time.time() - start)