luciano/clojure-koans
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Update src/koans/13_recursion.clj

Browse source 
Made a separate function for the factorial function applied to bigints.

The reason for this is that after successfully implementing a solution for the "Simple things may appear simple." koan and the other non-bigint factorial koans, the `script/run` application throws a java.lang.StackOverflowError.  Instead, it should signal to the user that he's working on the next koan.
This commit is contained in:
eric-hu 2012-08-12 20:04:31 -07:00
parent 626f97de8f
commit 514e17f69c
1 changed files with 5 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
src/koans/13_recursion.clj
View file

@ -16,6 +16,9 @@
(defn factorial [n] (defn factorial [n]
__) __)
(defn factorial-bigint [n]
__)
(meditations (meditations
"Recursion ends with a base case" "Recursion ends with a base case"
(= true (is-even? 0)) (= true (is-even? 0))
@ -45,7 +48,7 @@
(= 24 (factorial 4)) (= 24 (factorial 4))
"You can even deal with very large numbers" "You can even deal with very large numbers"
(< 1000000000000000000000000N (factorial 1000N)) (< 1000000000000000000000000N (factorial-bigint 1000N))
"But what happens when the machine limits you?" "But what happens when the machine limits you?"
(< 1000000000000000000000000N (factorial 100003N))) (< 1000000000000000000000000N (factorial-bigint 100003N)))