Some recursive functions

gistfile1.lisp

(defun anyoddp (l)
           (cond ((null l) nil)
                 ((oddp (car l)) t)
                 (t (anyoddp (cdr l)))))
                 
(defun fact (n)
  (cond ((zerop n) 1)
        (t (* n (fact (1- n))))))
        
(defun laugh (n)
  (cond ((zerop n) '())
        (t (cons 'ha (laugh (1- n))))))

(defun add-up (l)
  (reduce #'+ l))
  
(defun add-up-2 (l)
  (cond ((null l) 0)
        (t (+ (car l) (add-up-2 (cdr l))))))

(defun alloddp (l)
  (cond ((null l) t)
        ((evenp (car l)) nil)
        (t (alloddp (cdr l)))))

(defun rec-member (m l)
  (cond ((null l) nil)
        ((equal (car l) m) l)
        (t (rec-member m (cdr l)))))

(defun fib (n)
  (cond ((< n 2) 1)
        (t (+ (fib (- n 1)) (fib (- n 2))))))

(defun last-element (l)
  (cond ((atom (cdr l)) (car l))
        (t (last-element (cdr l)))))
        
(defun count-down (n)
  (cond ((equal n 1) '(1))
        (t (cons n (count-down (1- n))))))

(defun square-list (l)
  (cond ((null l) nil)
        (t (cons (* (car l) (car l)) (square-list (cdr l))))))