(let loop ((i 0)
(j 20) ;; comparison value: it decreases at each recursion (except the first one)
(topvalue 20)) ;; komodo value : must be equal to j at the beginning
( ...
↧