<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>寒星轩 - 5 - 算法</title><link>http://blog.csdn.net/starlee/category/317229.aspx</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Wed, 16 Apr 2008 21:55:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>StarLee</dc:creator><title>用欧几里得算法求最大公约数</title><link>http://blog.csdn.net/starlee/archive/2007/07/04/1678075.aspx</link><pubDate>Wed, 04 Jul 2007 10:35:00 GMT</pubDate><guid>http://blog.csdn.net/starlee/archive/2007/07/04/1678075.aspx</guid><wfw:comment>http://blog.csdn.net/starlee/comments/1678075.aspx</wfw:comment><comments>http://blog.csdn.net/starlee/archive/2007/07/04/1678075.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/starlee/comments/commentRss/1678075.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1678075</trackback:ping><description>用欧几里得算法求最大公约数。&lt;img src ="http://blog.csdn.net/starlee/aggbug/1678075.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>StarLee</dc:creator><title>不用临时变量交换两个变量的值</title><link>http://blog.csdn.net/starlee/archive/2006/02/15/599611.aspx</link><pubDate>Wed, 15 Feb 2006 16:10:00 GMT</pubDate><guid>http://blog.csdn.net/starlee/archive/2006/02/15/599611.aspx</guid><wfw:comment>http://blog.csdn.net/starlee/comments/599611.aspx</wfw:comment><comments>http://blog.csdn.net/starlee/archive/2006/02/15/599611.aspx#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://blog.csdn.net/starlee/comments/commentRss/599611.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=599611</trackback:ping><description>利用异或来实现不用临时变量交换两个变量的值。&lt;img src ="http://blog.csdn.net/starlee/aggbug/599611.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>StarLee</dc:creator><title>Fibonacci（斐波那契）序列的递归和非递归算法</title><link>http://blog.csdn.net/starlee/archive/2006/02/13/598036.aspx</link><pubDate>Mon, 13 Feb 2006 16:25:00 GMT</pubDate><guid>http://blog.csdn.net/starlee/archive/2006/02/13/598036.aspx</guid><wfw:comment>http://blog.csdn.net/starlee/comments/598036.aspx</wfw:comment><comments>http://blog.csdn.net/starlee/archive/2006/02/13/598036.aspx#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://blog.csdn.net/starlee/comments/commentRss/598036.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=598036</trackback:ping><description>Fibonacci序列的递归和非递归算法。&lt;img src ="http://blog.csdn.net/starlee/aggbug/598036.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>