[racket] learning recursion

You might consider reading/using The Little Schemer to learn recursion (and a whole lot more).

Steve
      From: Geoffrey S. Knauth <geoff at knauth.org>
 To: users at racket-lang.org 
 Sent: Wednesday, February 4, 2015 10:25 AM
 Subject: Re: [racket] learning recursion
   
On Wed, Feb 4, 2015, at 13:01, Roelof Wobben wrote:
> Is racket a good language to learn recursion the right way ?

Sure!  But it's really the educational material of How to Design
Programs (HtDP) [1] that comes with DrRacket that makes the experience
of learning the "right" patterns an easier experience than it might
otherwise be.  Also, this list is one of the friendliest lists you'll
find anywhere, with people of all experience levels getting along well,
where questions no matter how simple or complicated are almost always
answered by people who will point you in the right direction.

As for what language is best, though I like Racket a lot, the principles
of HtDP can be applied to many languages.  When it comes to recursion,
the first thing to learn is when a recursion should stop.  Then you
learn that a recursive call is a natural and succinct way to
compartmentalize computation to the thing you are looking at right now,
combined with the result of similar computations that are aggregated
elegantly through recursion.  Later you learn how to make recursive
calls efficient.

-- 
Geoffrey S. Knauth | http://knauth.org/gsk

[1] http://www.ccs.neu.edu/home/matthias/HtDP2e/


____________________
  Racket Users list:
  http://lists.racket-lang.org/users


  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20150205/f1c5ba4d/attachment.html>