Data update

Task/Anonymous-recursion/Ada/anonymous-recursion.ada

@@ -1,16 +0,0 @@
-   function Fib (X: in Integer) return Integer is
-      function Actual_Fib (N: in Integer) return Integer is
-      begin
-         if N < 2 then
-            return N;
-         else
-            return Actual_Fib (N-1) + Actual_Fib (N-2);
-         end if;
-      end Actual_Fib;
-   begin
-      if X < 0 then
-         raise Constraint_Error;
-      else
-         return Actual_Fib (X);
-      end if;
-   end Fib;

Task/Anonymous-recursion/AutoIt/anonymous-recursion.autoit

@@ -1,15 +0,0 @@
-ConsoleWrite(Fibonacci(10) & @CRLF)						; ## USAGE EXAMPLE
-ConsoleWrite(Fibonacci(20) & @CRLF)						; ## USAGE EXAMPLE
-ConsoleWrite(Fibonacci(30))						        ; ## USAGE EXAMPLE
-
-Func Fibonacci($number)
-
-	If $number < 0 Then Return "Invalid argument" 				; No negative numbers
-
-	If $number < 2 Then 							; If $number equals 0 or 1
-		Return $number  						; then return that $number
-	Else									; Else $number equals 2 or more
-		Return Fibonacci($number - 1) + Fibonacci($number - 2) 		; FIBONACCI!
-	EndIf
-
-EndFunc

Task/Anonymous-recursion/Elena/anonymous-recursion.elena

@@ -17,7 +17,7 @@ fib(n)
    }(n)
 }
 
-public program()
+public Program()
 {
    for (int i := -1; i <= 10; i += 1)
    {

Task/Anonymous-recursion/REBOL/anonymous-recursion.rebol

@@ -1 +0,0 @@
-fib: func [n /f][ do f: func [m] [ either m < 2 [m][(f m - 1) + f m - 2]] n]