@@ -0,0 +1,501 @@
+package fibonacci;%0A%0Apublic class Fibonacci%0A%7B%0A  public static int fibonacci(int n)%0A  %7B%0A    if (n %3C 2)%0A      return n;%0A%0A    return fibonacci(n - 1) + fibonacci(n - 2);%0A  %7D%0A%0A  public static void main(String%5B%5D args)%0A  %7B%0A    if (args.length %3E 0)%0A    %7B%0A      try%0A      %7B%0A        int n = Integer.parseInt(args%5B0%5D);%0A%0A        System.out.println(fibonacci(n));%0A      %7D%0A      catch (NumberFormatException e)%0A      %7B%0A        System.err.printf(%22Given argument (%25s) is not a number!%22, args%5B0%5D);%0A      %7D%0A    %7D%0A  %7D%0A%7D%0A

Implement simple recursice fibonacci method