LispForum

for this code i dont know the error but it seems to be corect with a small error

(defun count3(x l)
(cond
((null l) 0)
((count x (car l)) (count3 (cdr l)))
(t f)
)
)

Ya my work for above one is using recursion as followos

(defun count1(x l y)
(cond
((null l) 0)
((eq x (car(l))) (setq y (+ y 1)))
(t (count1( (x (cdr(l)) y)
))

Write a LISP function "count" of two arguments, an atom x and a list L, which returns the number of times that x appears in the list L. Use recursion. example: > (count ‘a `(a b c a c a) ). Returns: 3 > (count ‘d ‘(a b c a c a) ) Returns: 0 Write the LISP function “count” of exer...

what would we replace set!

i got some code like this (define (partialpaths X Y) (cond ((null? X) Y) ((member1 (car(car X)) Y) (partialpaths (cdr X) Y)) (#t (cons (car(car X)) Y)) ) ) (define (member1 X Y) (cond ((null? X) #f) ((eq? Z (car X)) #t) (#t (member1 Z (cdr X))) ) ) but i am not sure this code by using lisp.

k thank u very much for u r help my friend

CAN ANY ONE HELP Write the function partialpaths, of two arguments. The first argument is a list of lists, representing a graph(adjacency list representation of a graph). The second argument is a partial path in the reverse order, for example the path "from a to b to c" is represented by t...

thank u

is there any funtion to test wherther the given list is in ascending or descendin order
I saw one funtion INSEQA but ts not working