Explore >> Select a destination
|
You are here 
|
imagine27.com | ||
| | | | |
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). | |
| | | | |
antoinevastel.com
|
|
| | | | | This post presents 4 Javascript solutions to compute the nth term of a Fibonacci sequence. | |
| | | | |
www.pmatiello.me
|
|
| | | | | In which I give my own half-baked workaround to the lack of tail call optimization in Python | |
| | | | |
simpleprogrammer.com
|
|
| | | Software Engineers do the complex work so that we can enjoy efficient software solutions. They're creating the systems behind the digital tools we use at work or in our personal life. This takes strong logical thinking and problem-solving skills, as well as a deep knowledge of computer science and programming. It's a challenging, but exciting [...] | ||
