<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>看!corey,那天比你高多拉~~~ - 算法</title><link>http://blog.csdn.net/turkeyzhou/category/365500.aspx</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Sat, 30 Aug 2008 00:59:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>corey</dc:creator><title>收藏：牛人的回字算法</title><link>http://blog.csdn.net/turkeyzhou/archive/2008/08/26/2835445.aspx</link><pubDate>Tue, 26 Aug 2008 23:21:00 GMT</pubDate><guid>http://blog.csdn.net/turkeyzhou/archive/2008/08/26/2835445.aspx</guid><wfw:comment>http://blog.csdn.net/turkeyzhou/comments/2835445.aspx</wfw:comment><comments>http://blog.csdn.net/turkeyzhou/archive/2008/08/26/2835445.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/turkeyzhou/comments/commentRss/2835445.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2835445</trackback:ping><description>回字打印算法：孔已己&lt;img src ="http://blog.csdn.net/turkeyzhou/aggbug/2835445.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>corey</dc:creator><title>迷宫算法</title><link>http://blog.csdn.net/turkeyzhou/archive/2008/08/26/2830322.aspx</link><pubDate>Tue, 26 Aug 2008 01:28:00 GMT</pubDate><guid>http://blog.csdn.net/turkeyzhou/archive/2008/08/26/2830322.aspx</guid><wfw:comment>http://blog.csdn.net/turkeyzhou/comments/2830322.aspx</wfw:comment><comments>http://blog.csdn.net/turkeyzhou/archive/2008/08/26/2830322.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/turkeyzhou/comments/commentRss/2830322.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2830322</trackback:ping><description>做web的。算法一向不如做底层的，我承认我算法不行，编程之美买来了也美看多少，但是我还是很希望能研究研究，那么从最小的算法开始吧！&lt;img src ="http://blog.csdn.net/turkeyzhou/aggbug/2830322.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>corey</dc:creator><title>oracle PL/SQL学习</title><link>http://blog.csdn.net/turkeyzhou/archive/2008/05/13/2443232.aspx</link><pubDate>Tue, 13 May 2008 22:44:00 GMT</pubDate><guid>http://blog.csdn.net/turkeyzhou/archive/2008/05/13/2443232.aspx</guid><wfw:comment>http://blog.csdn.net/turkeyzhou/comments/2443232.aspx</wfw:comment><comments>http://blog.csdn.net/turkeyzhou/archive/2008/05/13/2443232.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/turkeyzhou/comments/commentRss/2443232.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2443232</trackback:ping><description>本章介绍了PL/SQL的基本知识，下一章，我们会详细的来学习PL/SQL的其他知识&lt;img src ="http://blog.csdn.net/turkeyzhou/aggbug/2443232.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>corey</dc:creator><title>字母全排列快速算法C代码 </title><link>http://blog.csdn.net/turkeyzhou/archive/2008/02/26/2121793.aspx</link><pubDate>Tue, 26 Feb 2008 12:23:00 GMT</pubDate><guid>http://blog.csdn.net/turkeyzhou/archive/2008/02/26/2121793.aspx</guid><wfw:comment>http://blog.csdn.net/turkeyzhou/comments/2121793.aspx</wfw:comment><comments>http://blog.csdn.net/turkeyzhou/archive/2008/02/26/2121793.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/turkeyzhou/comments/commentRss/2121793.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2121793</trackback:ping><description>

	全排列，比如字母ABC，所有排列有A ，AB，AC，ABC，ACB，B，BA，BC，BAC，BCA，C，CA，CB，CAB，CBA。//原理是插入,&amp;nbsp;在一个字符串的所有位置插入新字符.//如:&amp;nbsp;AB&amp;nbsp;插入C&amp;nbsp;,&amp;nbsp;位置有&amp;nbsp;1A2B3,&amp;nbsp;插入后形成&amp;nbsp;CAB&amp;nbsp;ACB&amp;nbsp;ABCchar&amp;nbsp;*AllList(char&amp;nbsp;*str,&amp;nbsp;int&amp;nbsp;*pNum)...{&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;int&amp;nbsp;i,&amp;nbsp;j,&amp;nbsp;k,&amp;nbsp;n;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;int&amp;nbsp;len&amp;nbsp;=&amp;nbsp;strlen(str);&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;int&amp;nbsp;Total&amp;nbsp;=&amp;nbsp;0;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;int&amp;nbsp;count,&amp;nbsp;oldcount;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;img src ="http://blog.csdn.net/turkeyzhou/aggbug/2121793.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>corey</dc:creator><title>最大公约数和最小公倍数</title><link>http://blog.csdn.net/turkeyzhou/archive/2008/02/19/2107457.aspx</link><pubDate>Tue, 19 Feb 2008 19:05:00 GMT</pubDate><guid>http://blog.csdn.net/turkeyzhou/archive/2008/02/19/2107457.aspx</guid><wfw:comment>http://blog.csdn.net/turkeyzhou/comments/2107457.aspx</wfw:comment><comments>http://blog.csdn.net/turkeyzhou/archive/2008/02/19/2107457.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/turkeyzhou/comments/commentRss/2107457.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2107457</trackback:ping><description>最大公约数和最小公倍数&lt;img src ="http://blog.csdn.net/turkeyzhou/aggbug/2107457.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>