L-system in LISP

Закрыт Опубликован 4 мес. назад Оплачивается при доставке
Закрыт Оплачивается при доставке

I need a function in lisp that implements an L-system: of the rule type a (1) follows (2), a (2) follows (1 2), starting from (1) in a recursive manner you get: (1), (2), (1 2), (2 1 2), (1 2 2 1 2), (2 1 2 1 2), etc...

Ввод данных Программирование

ID проекта: #36657422

О проекте

6 заявок(-ки) Удаленный проект Последняя активность 2 мес. назад

6 фрилансеров(-а) готовы выполнить эту работу в среднем за $20

gyarasiyagyaras4

Hello sir/ madam I checked your project description. I can do PDF into Excel converting task with 100% accuracy & i am ready to start right now. If you are interested to message me we can discuss more. Thank you. Regar Больше

$20 USD за 5 дней(-я)
(0 отзывов(-а))
0.0
ItsMrVishal

I am excited about the opportunity to work on the task of writing a function in Lisp for you. With my expertise and experience in Lisp programming, I am confident that I am the ideal candidate to deliver a high-quality Больше

$20 USD за 1 день
(0 отзывов(-а))
0.0
tuanthanhle

I can do it. i am very good at kind of this project. I am sure i can help you on this project. Please contact me if you need to discuss more

$30 USD за 1 день
(0 отзывов(-а))
0.0