brozek/website
1
0
Fork 0
mirror of https://github.com/Brandon-Rozek/website.git synced 2024-11-22 00:06:29 -05:00
Code Issues Projects Releases Packages Wiki Activity

Fixed sentence in tco post.

Browse source
This commit is contained in:
Brandon Rozek 2020-10-14 23:56:05 -04:00
parent a8526b57ba
commit 682ee2080a
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
content/blog/tcopython.md
View file

@ -30,7 +30,7 @@ RecursionError: maximum recursion depth exceeded in comparison
## Implementation
To get around this in Python, we need some sort of [trampoline](https://en.wikipedia.org/wiki/Tail_call#Through_trampolining), or way to exit part the stack and call the recursive function again. This technique is called Tail Call Optimizatoin, and we can do this in Python using exceptions. This code is heavily inspired by Crutcher Dunnavant's [code snippet](https://code.activestate.com/recipes/474088-tail-call-optimization-decorator/) from 2006.
To get around this in Python, we need some sort of [trampoline](https://en.wikipedia.org/wiki/Tail_call#Through_trampolining), or way to exit part the stack and call the recursive function again. This technique is often used in Tail Call Optimization, and we can do this in Python using exceptions. This code is heavily inspired by Crutcher Dunnavant's [code snippet](https://code.activestate.com/recipes/474088-tail-call-optimization-decorator/) from 2006.
```python
"""
@ -121,4 +121,4 @@ You can install the package via pypi:
pip install tail-recurse
```
It is also available on [Github](https://github.com/Brandon-Rozek/tail-recurse/).
It is also available on [Github](https://github.com/Brandon-Rozek/tail-recurse/).