This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
One story every computing enthusiast should hear is the lesson of how loops and tail-recursion are equivalent. We like recursive functions because they’re amenable to induction, and we can derive them in a way that is in direct correspondence with the definition of the datatype over which they recur. We like loops because they’re fast and make intuitive sense as long as variables don’t change in…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.