Short LISP Problem

$30-250 CAD

Closed

Posted

about 9 years ago

$30-250 CAD

Paid on delivery

Hi there, I need help with the attached problem, also described here: https://docs.google.com/presentation/d/1lS9zS-_fAG16Bce2Szqt9N8OWureRp9DWAOLHpKdPe8/edit#slide=id.g62edb8515_013 First, It would be great to figure out Part 1. If you can do the rest that would be great too. Thanks, Cheers, F

Lisp

Project ID: 7213715

About the project

5 proposals

Remote project

Active 9 yrs ago

Looking to make some money?

Email address

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

5 freelancers are bidding on average $65 CAD for this job

@hindmostone

Hello! The task seems to not difficut, I can do that. I did things like the "match[-var]" (part 2 & 3) before.

$55 CAD in 2 days

5.0

(6 reviews)

3.2

@dsrrathor

Hello, I've completed a course in LISP in my graduation and I've good experience dealing with lisp problems. I'll complete all three parts for you :)

$111 CAD in 1 day

5.0

(1 review)

1.8

@aleksandar2901

I have done projects in LISP during the course of Artificial intelligence,held by Faculty of Electronic Engineering in Nis. I'm hard worker and resourceful,and I need a chance to prove myself. I hope You will pick me. Regards, Aleksandar.

$50 CAD in 2 days

0.0

(0 reviews)

0.0

@Giules

A proposal has not yet been provided

$66 CAD in 2 days

0.0

(0 reviews)

0.0

@CGabrielC

I already made the first two parts and if you need, I can also do the third one (match-var). In order to prove you that I deserve to win this project and that I already start working, here is the range function: (defun range (L) (list (apply #'min L) (apply #'max L)) ) I also made: all-length, before, split-if, group, mostn and match.

$45 CAD in 3 days