> circle of recursion
I reckon "helix of recursion" would be a more helpful image.
Dan
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...
On Sat, Oct 22, 2016 at 3:05 PM, wrote:
> Robby Findler [16-10-22 21:28]:
>> You need to follow the design recipe to solve a problem like this. You
>> data is clear: [Listof [Listof Real]] and [Listof Real]. Next up:
>> examples. Do you have examples of the inputs and outputs you want for
>> thi
A clue to the answer is in your statement that you "feed that [maximum]
into the next circle of recursion." Notice that you're not overwriting the
value in the current call, you're creating a new value that you feed into
the new call in the "next circle". So the old one isn't being overwritten
at a
I'm not sure if I understand what you're tying to do correctly, but here's
one way to do it (or one way to do something, at least):
(define (process-list-of-lists list-of-lists)
(apply map
(λ args
(apply max args))
list-of-lists))
(process-list-of-lists
`
You need to follow the design recipe to solve a problem like this. You
data is clear: [Listof [Listof Real]] and [Listof Real]. Next up:
examples. Do you have examples of the inputs and outputs you want for
this function?
Robby
On Sat, Oct 22, 2016 at 2:03 PM, wrote:
> Hi,
>
> (I am still a new
Hi,
(I am still a newbie ... )
If I remember one rule of functional programming
correctly, it says:
Instead of changeing data - create new data.
Suppose I have a list of list. Each "sublist" is
made of a greater amount (but identical count) of
exact numbers (integers).
I want to process the
6 matches
Mail list logo