Explore >> Select a destination
|
You are here 
|
blog.moertel.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). | |
| | | | |
volgarev.me
|
|
| | | | | ||
| | | | |
2ality.com
|
|
| | | | | Update 2018-05-09: Even though tail call optimization is part of the language specification, it isn't supported by many engines and that may never change. The ideas are still interesting, however and explained in this blog post. ECMAScript 6 offers tail call optimization, where you can make some function calls without growing the call stack. This blog post explains how that works and what benefits it brings. | |
| | | | |
pymotw.com
|
|
| | | [AI summary] The provided text is a detailed exploration of Python's disassembler and its applications. It covers topics such as using the dis module to inspect bytecode, debugging with dis, and optimizing code by analyzing disassembled output. The text also discusses compiler optimizations like constant folding and the use of itertools for efficient iteration. It includes examples of code, disassembled output, and performance comparisons between different implementations. | ||
