diff options
| -rw-r--r-- | challenge-077/jeongoon/common-lisp/ch-1.lsp | 4 | ||||
| -rw-r--r-- | challenge-077/jeongoon/haskell/ch-1.hs | 2 |
2 files changed, 5 insertions, 1 deletions
diff --git a/challenge-077/jeongoon/common-lisp/ch-1.lsp b/challenge-077/jeongoon/common-lisp/ch-1.lsp index 24bf85a27e..b64f971657 100644 --- a/challenge-077/jeongoon/common-lisp/ch-1.lsp +++ b/challenge-077/jeongoon/common-lisp/ch-1.lsp @@ -1,4 +1,8 @@ ;; translated from ch-1.pl +;; tested with: +;; sbcl --script ch-1.lsp 99999 +;; (finished under 0.3 seconds) +;; common-lisp was winner in my implementation ;; fibonacci number in reverse order upto limit (defun rfibs (limit) ;; ignore first number 1 for challenge purpose diff --git a/challenge-077/jeongoon/haskell/ch-1.hs b/challenge-077/jeongoon/haskell/ch-1.hs index 9f438205d2..a17c909e2d 100644 --- a/challenge-077/jeongoon/haskell/ch-1.hs +++ b/challenge-077/jeongoon/haskell/ch-1.hs @@ -4,7 +4,7 @@ import Options.Generic import Data.List (findIndex, intersect, intercalate, sortBy, unfoldr) {- tested with: -runhaskell 150 # total 8 cases found +runhaskell 99999 # total 192 case(s) (slower than perl code T.T) -} -- fib, fib2: credit: https://wiki.haskell.org/The_Fibonacci_sequence fib = fst . fib2 |