WebInstruct

Search This Blog

LISP Palindrome Function

October 17, 2012

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

(defun ispalindrome (list)
(equal list (reverse list))
)

> (ispalindrome '(a b b a)) = T

LISP

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Comments

Recursive LISP function to find the power of a number

(defun power(base exp) ( if (eq exp 0) 1 ( * base (power base (- exp 1)) ) ) ) power 3 2 = 9

LISP Cube List Function

WITHOUT USING LET (defun cube-list (lst) (cond ((null lst) nil) (t ( cons (* (car lst) (car lst) (car lst)) (cube-list(cdr lst)) ) ) ) ) USING LET (defun cube-list (lst) (cond ((null lst) nil) (t ( let ((a (car lst))) (cons (* a a a) (cube-list(cdr lst))) ) ) ) )

LISP append lists function

(defun my-append(list1 list2) ( if (null list1) list2 (cons (car list1) (my-append (cdr list1) list2)) ) ) Test Cases > my-append '() '(a) = (a) > my-append '(a b c) '(d e f) = (a b c d e f)

Powered by Blogger

LISP Palindrome Function

Comments

Post a Comment