3 files changed, 69 insertions, 0 deletions
diff --git a/entries/ionathanch/agda/Fib.agda b/entries/ionathanch/Fib.agda
index a12b0a5..a12b0a5 100644
--- a/entries/ionathanch/agda/Fib.agda
+++ b/entries/ionathanch/Fib.agda
diff --git a/entries/ionathanch/fib.f90 b/entries/ionathanch/fib.f90
new file mode 100644
index 0000000..3cf1850
--- /dev/null
+++ b/entries/ionathanch/fib.f90
@@ -0,0 +1,21 @@
+PROGRAM main
+  ! The 93rd Fibonacci number is the largest that fits in 64 bits anyway
+  CHARACTER(3) :: kth
+  INTEGER :: k
+  CALL get_command_argument(1, kth)
+  READ(kth, *) k
+  WRITE(*, *) fib(k)
+CONTAINS
+
+PURE RECURSIVE INTEGER*8 FUNCTION fib(k) RESULT(n)
+  INTEGER, INTENT (IN) :: k
+  IF (k == 0) THEN
+    n = 0
+  ELSE IF (k == 1) THEN
+    n = 1
+  ELSE
+    n = fib(k - 1) + fib(k - 2)
+  END IF
+END FUNCTION fib
+
+END PROGRAM
diff --git a/entries/perryliao/fib.groovy b/entries/perryliao/fib.groovy
new file mode 100644
index 0000000..af1c4df
--- /dev/null
+++ b/entries/perryliao/fib.groovy
@@ -0,0 +1,48 @@
+pipeline {
+    agent any
+
+    parameters {
+        string defaultValue: '2', description: 'Number to compute in the Fibonacci Sequence', name: 'num', trim: true
+    }
+
+    stages {
+        stage('Create Cache') {
+            steps {
+                script {
+                    if (!fileExists("fibbonacciCache")) {
+                        sh 'echo "0\n1" > fibbonacciCache'
+                    }
+                }
+            }
+        }
+        stage('Validate Parameter') {
+            steps {
+                script {
+                    assert params.num.isInteger()
+                }
+            }
+        }
+        stage('Get Fibbonacci') {
+            steps {
+                script {
+                    result = fib(params.num.toInteger())
+                    println("The result is F(${params.num}) = ${result}")
+                }
+            }
+        }
+    }
+}
+
+int fib(int n, cache = 'fibbonacciCache') {
+    nComputed = sh(returnStdout: true, script: "wc -l < ${cache}").trim().toInteger()
+    if (n >= nComputed) {
+        // Need to do more recursion
+        result = fib(n - 2, cache) + fib(n - 1, cache)
+        sh "echo '${result}' >> ${cache}"
+        return result
+    } else {
+        // Already have what we need, so read from cache
+        return sh(returnStdout: true, script: "sed -n '${n + 1}p' ${cache}").trim().toInteger()
+    }
+}
+