Explore >> Select a destination
|
You are here 
|
volgarev.me | ||
| | | | |
abhinavomprakash.com
|
|
| | | | | Defining recursion in terms of itself is an old joke among programmers. Despite the fact that it frustrates a lot of new-comers, we don't change it. I like to define recursion as "Iteration for the cool kids". I don't mean this in a snobbish, let-us-exclude-the-for-loopers kinda way, but rather in a tone of appreciation. Recursion is an elegant way of doing things. Recursive alogrithms are concise, have less noise and have immutability baked in (always a plus). | |
| | | | |
abdulapopoola.com
|
|
| | | | | The biggest advantage of using tail calls is that they allow you to do extensive operations without exceeding the call stack. This makes it possible to do a lot of work in constant space without running into out of memory exceptions; this happens because the frame for the currently executing function is re-used by the... | |
| | | | |
nithinbekal.com
|
|
| | | | | Nithin Bekal's blog about programming - Ruby, Rails, Vim, Elixir. | |
| | | | |
gbracha.blogspot.com
|
|
| | | In this post, I wanted to make a case for reflection in the context of pure functional programming. I don't know that pure functional langua... | ||
