<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cjpddswd的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/cjpddswd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; cjpddswd]]></copyright><item><title><![CDATA[植树节-在电脑上种颗树-python实现-递归]]></title><link>https://blog.youkuaiyun.com/cjpddswd/article/details/123452362</link><guid>https://blog.youkuaiyun.com/cjpddswd/article/details/123452362</guid><author>cjpddswd</author><pubDate>Sat, 12 Mar 2022 23:16:52 +0800</pubDate><description><![CDATA[猛的发现今天是植树节，从来不关注节日的我今日要为咱们植树节来纪念纪念，咱们画颗树！
本文涉及Python Turtle库，递归算法…
先给代码，咱们再来慢慢解释递归的魅力以及一个理解递归算法运行机制的好方法！

```python
import turtle as t


def tree(n):
    if n &gt; 5:
        t.forward(n)
        t.right(20)
        tree(n-15) #在所有此递归调用全部压入栈之后运行下面的代码
     ]]></description><category></category></item></channel></rss>