Simple web application for benchmark
Since the Fibonacci algorithm is so nice and clean there is one little nitpicky thing to add. You don't need to directly return 0 and 1 in the base cases, you can just return n. So the function can be rewritten (in Javascript, my experience with Python is extremely subpar) as:

var fib = function(n) {
    if(n === 0 || n === 1) {
        return n;
    }

    return fib(n - 1) + fib(n - 2);
}


The algorithm is beautiful but it also does a lot of extraneous work when run in a loop, that can be removed with the technique of memoization (again, to keep these tests fair, I think (?) this is possible in Python as well but someone else could be of more use in helping with the code). In this specific case, the technique is incredibly easy to employ with a simple Javascript object as a cache

var fib = (function() {
    var cache = {};

    function fibonacci(n) {
        if(n === 0 || n === 1) {
             return n;
        }

        return fibonacci(n - 1) + fibonacci(n - 2);
    }

    return function(n) {
       if(n in cache) {
           return cache[n];
       }

       return fibonacci(n);           
    }
}());