fixup: CLI arguments for C, CPP, Go, Ruby

Signed-off-by: Richard Zak <[email protected]>

.gitignore

@@ -4,3 +4,5 @@ Zig/*/zig-out/
 .idea/
 .vscode/
 result
+*.wasm
+a.out

C++/fibonacci/fibonacci.cpp

@@ -1,16 +1,32 @@
-// Simple Program to calculate Fibonacci Sequence of an integer input
 #include <iostream>
+#include <cstdlib>
 using namespace std;
+
+#define DEFAULT_N 10
+
 int FibonacciSequence(int num) {
     if(num <= 1) {
         return num ;
     }
     return FibonacciSequence(num-1) + FibonacciSequence(num-2);
 }
-int main(){
-    cout << "Enter the Number" << endl;
-    int n ;
-    cin  >> n ;
 
-    cout << "Fibonacci Sequence term at " << n << "  " << "is " << FibonacciSequence(n) << endl;
+int main(int argc, char* argv[]){
+	int n = DEFAULT_N;
+	if (argc > 1) {
+		n = atoi(argv[1]);
+	} else {
+		cout << "Which Fibonacci index to find? ";
+		cout.flush();
+		cin >> n;
+	}
+
+	if (n < -1) {
+		n = DEFAULT_N;
+	} else if (n > 45) {
+		// This should be able to finish in a decent amount of time.
+		n = 45;
+	}
+
+    cout << "Fibonacci sequence number at index " << n << " is " << FibonacciSequence(n) << endl;
 }

C/fibonacci/fibonacci.c

@@ -1,15 +1,33 @@
 #include <stdio.h>
+#include <stdlib.h>
+
+#define DEFAULT_N 10
 
 int FibonacciSequence(int num) {
     if(num <= 1) {
         return num ;
     }
     return FibonacciSequence(num-1) + FibonacciSequence(num-2);
 }
-int main(){
-    printf("Enter the Number\n");
-    int n ;
-    scanf("%d",&n);
 
-    printf("Fibonacci Sequence term at %d is %d " , n , FibonacciSequence(n));
+int main(int argc, char* argv[]){
+	int n = DEFAULT_N;
+    if (argc > 1) {
+    	n = atoi(argv[1]);
+    } else {
+    	printf("Which Fibonacci index to find? ");
+    	int matched = scanf("%d", &n);
+    	if (matched < 1) {
+    		n = DEFAULT_N;
+    	}
+    }
+
+    if (n < -1) {
+		n = DEFAULT_N;
+	} else if (n > 45) {
+		// This should be able to finish in a decent amount of time.
+		n = 45;
+	}
+
+    printf("Fibonacci sequence number at index %d is %d" , n , FibonacciSequence(n));
 }

Go/fibonacci/go.mod

@@ -0,0 +1,3 @@
+module github.com/enarx/codex/Go/fibonacci
+
+go 1.17

Go/fibonacci/main.go

@@ -1,19 +1,39 @@
-// Simple Program to calculate fibonacci of input
-
 package main
 
-import "fmt"
-func FibonacciRecursion(n int) int {
+import (
+	"fmt"
+	"strconv"
+	"os"
+)
+
+const DEFAULT_N int = 10
+
+func FibonacciSequence(n int) int {
     if n <= 1 {
         return n
     }
-    return FibonacciRecursion(n-1) + FibonacciRecursion(n-2)
+    return FibonacciSequence(n-1) + FibonacciSequence(n-2)
 }
 
 func main(){
-    fmt.Print("Enter number : ")
-    var n int
-    fmt.Scanln(&n)
+    n := DEFAULT_N
+
+    if len(os.Args) > 1 {
+    	n, _ = strconv.Atoi(os.Args[1])
+    } else {
+    	var input string
+    	fmt.Print("Which Fibonacci index to find? ")
+    	fmt.Scanln(&input)
+		n, _ = strconv.Atoi(input)
+    }
+
+    if n < -1 {
+		n = DEFAULT_N
+	} else if n > 45 {
+		// This should be able to finish in a decent amount of time.
+		n = 45
+	}
+
 
-    fmt.Println("Fibonacci of", n , "is", FibonacciRecursion(n));
+    fmt.Printf("Fibonacci sequence number at index %d is %d" , n , FibonacciSequence(n));
 }

Ruby/fibonacci/fibonacci.rb

@@ -1,5 +1,24 @@
-def fibonacci( n )
+def FibonacciSequence( n )
   return  n  if ( 0..1 ).include? n
-  ( fibonacci( n - 1 ) + fibonacci( n - 2 ) )
+  ( FibonacciSequence( n - 1 ) + FibonacciSequence( n - 2 ) )
 end
-puts fibonacci( 5 )
+
+DEFAULT = 10
+
+n = DEFAULT
+
+if ARGV.length > 0
+  n = ARGV[0].to_i
+else
+  puts "Which Fibonacci index to find? "
+  n = ARGF.gets.to_i
+end
+
+if n < -1
+  n = DEFAULT
+elsif n > 40
+  # This should be able to finish in a decent amount of time.
+  n = 40
+end
+
+puts "Fibonacci sequence number at index #{n} is #{FibonacciSequence(n)}"