LISP Functions

Closed Posted 5 years ago Paid on delivery

$10-30 USD

Paid on delivery

Closed Paid on delivery

Hi I just started learning LISP, and I need someone to help me figure out how to write some functions. Message me for details

Define a function `Last` that takes two parameters, a symbol A and a list of symbols L, and returns the list starting where the last occurrence of symbol A is in L. It returns nil only if A is not in the list.
Examples:
. (Last 'a '(a b c a b c a b c d e f g)) --> (a b c d e f g)
. (Last 'b '(a b c a b c a b c d e f g)) --> (b c d e f g)
. (Last 'c '(a b c a b c a b c d e f g)) --> (c d e f g)
. (Last 'g '(a b c a b c a b c d e f g)) --> (g)
. (Last 'h '(a b c a b c a b c d e f g)) --> nil

PHP Software Architecture

Project ID: #18071595

About the project

4 proposals Remote project Active 5 years ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs

4 freelancers are bidding on average $24 for this job

ahmsak's Profile Picture
ahmsak

Hello Sir, I am a computer science tutor, I teach (among others) LISP, Haskell, and Advanced Algorithms. I have done many projects like this, and I'm one of the top LISP developers, and you can check by clicking on m More

$30 USD in 0 days
(67 Reviews)
6.0
tuanthanhle's Profile Picture
tuanthanhle

i can do it

$30 USD in 1 day
(8 Reviews)
3.6
jk31's Profile Picture
jk31

Hello, such kind of problems, I will be able in not so much time. I am a common-lisper and Racket programmer, too. Oh I already solved the problem. It took me just 10 minutes. With tail call recursion. What More

$10 USD in 0 days
(0 Reviews)
0.0
Post a project like this