
blog.moertel.com/posts/2013-05-11-recursive-to-iterative.html
Preview meta tags from the blog.moertel.com website.
Linked Hostnames
6- 2 links toblog.moertel.com
- 2 links toen.wikipedia.org
- 2 links togithub.com
- 1 link tojaspervdj.be
- 1 link towww.pythontutor.com
- 1 link towww.youtube.com
General Meta Tags
3- titleTricks of the trade: Recursion to Iteration, Part 1: The Simple Method, secret features, and accumulators - Tom Moertel’s Blog
- Content-Typetext/html; charset=UTF-8
- viewportwidth=device-width, initial-scale=1
Link Tags
11- alternatehttp://feeds.feedburner.com/TomMoertelsBlog
- apple-touch-icon../apple-touch-icon.png
- icon../favicon-32x32.png
- icon../favicon-16x16.png
- manifest../site.webmanifest
Links
9- http://blog.moertel.com/tags/recursion-to-iteration%20series.html
- http://en.wikipedia.org/wiki/Mathematical_induction
- http://en.wikipedia.org/wiki/Tail_call
- http://jaspervdj.be/hakyll
- http://www.pythontutor.com/visualize.html#code=%23+original+version%0A%0Adef+factorial(n)%3A%0A++++if+n+%3C+2%3A%0A++++++++return+1%0A++++return+n+*+factorial(n+-+1)%0A%0A%23+tail-call+version%0A%0Adef+factorial1a(n,+acc%3D1)%3A%0A+++++if+n+%3C+2%3A%0A+++++++++return+1+*+acc%0A+++++return+factorial1a(n+-+1,+acc+*+n)%0A%0A%23+iterative+version%0A%0Adef+factorial1d(n,+acc%3D1)%3A%0A++++while+n+%3E+1%3A%0A++++++++(n,+acc)+%3D+(n+-+1,+acc+*+n)%0A++++return+acc%0A%0Aprint+factorial(5)%0Aprint+factorial1a(5)%0Aprint+factorial1d(5)&mode=display&cumulative=false&heapPrimitives=false&drawParentPointers=false&textReferences=false&showOnlyOutputs=false&py=2