You have problems, and we're glad to hear them. Explain the problem, what you have tried, and where you got stuck.
Feel free to share a little info on yourself and the course.
Please respect your teacher's guidelines. Homework is a learning tool. If we just post answers, we aren't actually helping. When you post questions, be sure to show what you have tried or what you don't understand.
I have to write a function that (push-left (L)) "pushes" a list to thr right or to the left.
(push-left '(1 2 3 4)) will give (2 3 4 1)
(push-right'(1 2 3 4)) will give (4 1 2 3)
The lecturer said we can't use functions 'last' or 'butlast'.
I tried to solve it with no success. Can you give me direction? Is there a way to solve it by recursion?
I thought to simply do this: (cons (rest L) (first L)), but it gives (rest L) as a list. Is there a way to "unlist" it?
- Posts: 6
- Joined: Wed Jun 06, 2012 12:41 am
Try using the function append
- Posts: 406
- Joined: Sat Mar 07, 2009 6:17 pm
- Location: Brazil
Return to Homework
Who is online
Users browsing this forum: No registered users and 3 guests