1. Implement fibonnaci 2. Implement atoi (string to int)
Sigiloso
1. fib(int n) { if (n == 0) return 0; if (n ==1) return 1; return fib(n-1) + fin(n-2); } 2. int atoi (String s) { int mult = 1; int result = 0; for (int i = 0; i < s.length; i++) { result = s.charAt(i) * mult; mult *= 10; } }