<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>落叶树的BLOG - 汇编学习</title><link>http://blog.csdn.net/hkbyest/category/323155.aspx</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Fri, 18 Apr 2008 14:39:50 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>落叶树</dc:creator><title>使用交换标志的冒泡排序算法汇编源代码</title><link>http://blog.csdn.net/hkbyest/archive/2007/08/06/1728700.aspx</link><pubDate>Mon, 06 Aug 2007 16:17:00 GMT</pubDate><guid>http://blog.csdn.net/hkbyest/archive/2007/08/06/1728700.aspx</guid><wfw:comment>http://blog.csdn.net/hkbyest/comments/1728700.aspx</wfw:comment><comments>http://blog.csdn.net/hkbyest/archive/2007/08/06/1728700.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hkbyest/comments/commentRss/1728700.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1728700</trackback:ping><description>使用交换标志的冒泡排序算法汇编源代码&lt;img src ="http://blog.csdn.net/hkbyest/aggbug/1728700.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>落叶树</dc:creator><title>Eratosthenes筛法的粗糙汇编源代码</title><link>http://blog.csdn.net/hkbyest/archive/2007/08/06/1728629.aspx</link><pubDate>Mon, 06 Aug 2007 15:38:00 GMT</pubDate><guid>http://blog.csdn.net/hkbyest/archive/2007/08/06/1728629.aspx</guid><wfw:comment>http://blog.csdn.net/hkbyest/comments/1728629.aspx</wfw:comment><comments>http://blog.csdn.net/hkbyest/archive/2007/08/06/1728629.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hkbyest/comments/commentRss/1728629.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1728629</trackback:ping><description>Eratosthenes筛法，筛选指定范围内的素数，汇编源代码&lt;img src ="http://blog.csdn.net/hkbyest/aggbug/1728629.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>落叶树</dc:creator><title>欧几里得求两个整数最大公约数算法的汇编递归实现代码</title><link>http://blog.csdn.net/hkbyest/archive/2007/07/30/1717049.aspx</link><pubDate>Mon, 30 Jul 2007 17:19:00 GMT</pubDate><guid>http://blog.csdn.net/hkbyest/archive/2007/07/30/1717049.aspx</guid><wfw:comment>http://blog.csdn.net/hkbyest/comments/1717049.aspx</wfw:comment><comments>http://blog.csdn.net/hkbyest/archive/2007/07/30/1717049.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hkbyest/comments/commentRss/1717049.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1717049</trackback:ping><description>欧几里得求两个整数最大公约数算法的汇编递归实现代码&lt;img src ="http://blog.csdn.net/hkbyest/aggbug/1717049.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>