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). | |
| | | | |
alexn.org
|
|
| | | | | ||
| | | | |
nithinbekal.com
|
|
| | | | | Nithin Bekal's blog about programming - Ruby, Rails, Vim, Elixir. | |
| | | | |
www.oranlooney.com
|
|
| | | I recently wrote an article which was ostensibly about the Fibonacci series but was really about optimization techniques. I wanted to follow up on its (extremely moderate) success by going in the exact opposite direction: by writing a Fibonacci function which is as slow as possible. This is not as easy as it sounds: any program can trivially be made slower, but this is boring. How can we make it slow in a fair and interesting way? | ||
