#57
Simple Recursion
 

Difficulty:N/A
Topics:elementary recursion


A recursive function is a function which calls itself. This is one of the fundamental techniques used in functional programming.
test not run
(= __ ((fn foo [x] (when (> x 0) (conj (foo (dec x)) x))) 5))


Code which fills in the blank: