@@ -0,0 +1,807 @@
+%0A/**%0A * I made this to explain recusion to someone.%0A * @author Vartan%0A */%0Apublic class Fibonacci %7B%0A%0A    public static int fib(int i) %7B%0A        return i%3C=1 ? i : fib(i-2)+fib(i-1);%0A    %7D%0A    /* For example:%0A     * Let's say we ask for        fib(5)%0A     *              fib(4)           +              fib(3)%0A     *      /fib(3)    +      fib(2)%5C   +    /fib(2)%5C    +    fib(1)%0A     * /fib(2)+   fib(1)%5C+/fib(1)+fib(0)%5C+/fib(1)+fib(0)%5C  +   1%0A    * /fib(1)+fib(0)%5C+ 1 +   1   +   0   +   1   +  0    +     1%0A     * 1    +  0  +  1  +    1   +   0   +   1   +  0    +     1%0A     *                        =5%0A     *%0A     * This function is extremely slow because it calls many functions. fib(5)%0A     * called fib() an additional 14 times, after which it can finally add all%0A     * of the 1s and 0s up.%0A     */%0A%7D%0A

Create fib.java