Vous êtes sur la page 1sur 1

Search an element:

-------------------------
Lisp:
(defun list-member(E L)
"Test if E is a member of L"
(cond
((null L) nil)
((eq E (car L)) t)
(t (list-member E (cdr L)))))
Prolog:
?-mem-list(X,L)-successds if X is a member of list L,
mem-list(X,[X/-])
mem-list(X,[-/Y]):-mem-list(X,Y)
GCD of two positive numbers:-
-----------------------------
Here a recursive definition is used.
gcd(A,A,A)
gcd(A,B,C):-A>B,A1 is A-B,gcd(A1,B,C)
gcd(A,B,C):-B>A,B1 is B-A,gcd(A,B1,C)
Fibo series:
fib(0,1)
fib(1,1)
fib(N,F):-N>1,N1 is N-1,N2 is N-2,
fib(N1,F1),fib(N2,F2),F is F1+F2
suggesstion:
search an element
GCD
fibonacci
factorial of a number(previously done)
Maximum of two numbers or maximum of three numbers(Patterson)

Vous aimerez peut-être aussi