LispForum

I didn't use the key argument. Thanks for the example. It was very helpful.

I like the idea of closures, though it is a bit above my pay-grade at the moment, Duke. I had another solution that used 'let' and 'dolist', but I didn't want to use setf. It must have been something I read somewhere about minimizing their usage. Is that just for a style of programming using Common ...

Thanks Kohath.

reduce worked beautifully. And I knew something was wrong when I used 'eval'.

I'm sure this is bad but:

I've been looking through all my books and scratching my head, but I found this nice web-page I shall be going over with a fine toothed comb when the time is right:

http://la7dja.org/lisp/clml/utils.lisp

Wouldn't you just find the difference between A and B for each point, divide by how many intermediate steps to get a transform list (T) and then mapcar adding T to A, and using each result list as the new A until A becomes B?

Got'cha

Yeah, I thought about 'length', but I knew to avoid creating cons cells for a new list as you do get a performance penalty for it. Thank you both for the info on tail-recursion. So my function is not tail recursive (as it calls #'+ last). I traced it and then disassembled it to see what was going on...

I heard that recursion was a lispy way of doing things, but there could be a better way. I'm not sure if it comes with a performance cost. Perhaps one of the pros can chime in. I'm still trying to get my head around what tail recursion is.

I'm just a newbie, how is this for a recursive solution:
Is there a simpler way to do this recusively?