<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>Henry的专栏 - </title><link>category/383898.aspx</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Fri, 02 May 2008 19:36:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>Henry</dc:creator><title>选择排序</title><link>http://blog.csdn.net/henrya2/archive/2008/05/02/2362175.aspx</link><pubDate>Fri, 02 May 2008 17:27:00 GMT</pubDate><guid>http://blog.csdn.net/henrya2/archive/2008/05/02/2362175.aspx</guid><wfw:comment>comments/2362175.aspx</wfw:comment><comments>http://blog.csdn.net/henrya2/archive/2008/05/02/2362175.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2362175.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2362175</trackback:ping><description>&lt;img src ="aggbug/2362175.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>henrya2</dc:creator><title>比较计数排序</title><link>http://blog.csdn.net/henrya2/archive/2008/05/01/2357540.aspx</link><pubDate>Thu, 01 May 2008 15:04:00 GMT</pubDate><guid>http://blog.csdn.net/henrya2/archive/2008/05/01/2357540.aspx</guid><wfw:comment>comments/2357540.aspx</wfw:comment><comments>http://blog.csdn.net/henrya2/archive/2008/05/01/2357540.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2357540.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2357540</trackback:ping><description>&lt;img src ="aggbug/2357540.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>henrya2</dc:creator><title>Locker doors 问题</title><link>http://blog.csdn.net/henrya2/archive/2008/04/26/2333383.aspx</link><pubDate>Sat, 26 Apr 2008 22:36:00 GMT</pubDate><guid>http://blog.csdn.net/henrya2/archive/2008/04/26/2333383.aspx</guid><wfw:comment>comments/2333383.aspx</wfw:comment><comments>http://blog.csdn.net/henrya2/archive/2008/04/26/2333383.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>comments/commentRss/2333383.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2333383</trackback:ping><description>&lt;img src ="aggbug/2333383.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>henrya2</dc:creator><title>计算floor(sqrt(n))</title><link>http://blog.csdn.net/henrya2/archive/2008/04/26/2333008.aspx</link><pubDate>Sat, 26 Apr 2008 20:00:00 GMT</pubDate><guid>http://blog.csdn.net/henrya2/archive/2008/04/26/2333008.aspx</guid><wfw:comment>comments/2333008.aspx</wfw:comment><comments>http://blog.csdn.net/henrya2/archive/2008/04/26/2333008.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2333008.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2333008</trackback:ping><description>&lt;img src ="aggbug/2333008.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>