﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><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>C++博客-goal00001111-最新评论</title><link>http://www.cppblog.com/goal00001111/CommentsRSS.aspx</link><description>理想，你是不是太遥远</description><language>zh-cn</language><pubDate>Tue, 18 Nov 2008 11:56:03 GMT</pubDate><lastBuildDate>Tue, 18 Nov 2008 11:56:03 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 我所理解的插入排序算法</title><link>http://www.cppblog.com/goal00001111/archive/2008/10/24/8771.html#64942</link><dc:creator>么样</dc:creator><author>么样</author><pubDate>Fri, 24 Oct 2008 08:16:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2008/10/24/8771.html#64942</guid><description><![CDATA[你就是一个傻逼，要写就写全，就会写最简单的<img src ="http://www.cppblog.com/goal00001111/aggbug/64942.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">么样</a> 2008-10-24 16:16 <a href="http://www.cppblog.com/goal00001111/archive/2008/10/24/8771.html#64942#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 我所理解的归并排序算法</title><link>http://www.cppblog.com/goal00001111/archive/2008/06/30/8612.html#54991</link><dc:creator>delacroix</dc:creator><author>delacroix</author><pubDate>Mon, 30 Jun 2008 15:21:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2008/06/30/8612.html#54991</guid><description><![CDATA[对啊，是不是漏掉了当log(n)不为整数（底数为2）时的情况？<img src ="http://www.cppblog.com/goal00001111/aggbug/54991.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">delacroix</a> 2008-06-30 23:21 <a href="http://www.cppblog.com/goal00001111/archive/2008/06/30/8612.html#54991#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 我所理解的归并排序算法</title><link>http://www.cppblog.com/goal00001111/archive/2008/04/16/8612.html#47275</link><dc:creator>indigio</dc:creator><author>indigio</author><pubDate>Wed, 16 Apr 2008 09:14:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2008/04/16/8612.html#47275</guid><description><![CDATA[      if (i+beforeLen &lt; n)<br>                  Merge(a, i, i+beforeLen-1, n-1, n);<br><br>感觉上漏掉了某些情况<img src ="http://www.cppblog.com/goal00001111/aggbug/47275.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">indigio</a> 2008-04-16 17:14 <a href="http://www.cppblog.com/goal00001111/archive/2008/04/16/8612.html#47275#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 平衡有序树AVL树之两种思路</title><link>http://www.cppblog.com/goal00001111/archive/2008/01/20/8151.html#41541</link><dc:creator>关注</dc:creator><author>关注</author><pubDate>Sun, 20 Jan 2008 14:10:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2008/01/20/8151.html#41541</guid><description><![CDATA[不错！！<img src ="http://www.cppblog.com/goal00001111/aggbug/41541.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">关注</a> 2008-01-20 22:10 <a href="http://www.cppblog.com/goal00001111/archive/2008/01/20/8151.html#41541#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 爱因斯坦的思考题</title><link>http://www.cppblog.com/goal00001111/archive/2007/12/25/16070.html#39591</link><dc:creator>秦歌</dc:creator><author>秦歌</author><pubDate>Tue, 25 Dec 2007 07:49:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2007/12/25/16070.html#39591</guid><description><![CDATA[这样呀！厉害！<img src ="http://www.cppblog.com/goal00001111/aggbug/39591.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">秦歌</a> 2007-12-25 15:49 <a href="http://www.cppblog.com/goal00001111/archive/2007/12/25/16070.html#39591#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 汉诺塔非递归算法</title><link>http://www.cppblog.com/goal00001111/archive/2007/11/07/8252.html#36036</link><dc:creator>寿桃用户入境</dc:creator><author>寿桃用户入境</author><pubDate>Wed, 07 Nov 2007 04:45:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2007/11/07/8252.html#36036</guid><description><![CDATA[疆景颇产<img src ="http://www.cppblog.com/goal00001111/aggbug/36036.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">寿桃用户入境</a> 2007-11-07 12:45 <a href="http://www.cppblog.com/goal00001111/archive/2007/11/07/8252.html#36036#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 爱因斯坦的思考题</title><link>http://www.cppblog.com/goal00001111/archive/2007/10/21/16070.html#34765</link><dc:creator>Minidx全文检索</dc:creator><author>Minidx全文检索</author><pubDate>Sun, 21 Oct 2007 09:39:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2007/10/21/16070.html#34765</guid><description><![CDATA[厉害！<br><img src ="http://www.cppblog.com/goal00001111/aggbug/34765.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">Minidx全文检索</a> 2007-10-21 17:39 <a href="http://www.cppblog.com/goal00001111/archive/2007/10/21/16070.html#34765#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 爱因斯坦的思考题</title><link>http://www.cppblog.com/goal00001111/archive/2007/10/21/16070.html#34761</link><dc:creator>没有</dc:creator><author>没有</author><pubDate>Sun, 21 Oct 2007 07:51:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2007/10/21/16070.html#34761</guid><description><![CDATA[我也做出来了，花了７５分钟．<br>利用推理过程算出来的｀｀｀<img src ="http://www.cppblog.com/goal00001111/aggbug/34761.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">没有</a> 2007-10-21 15:51 <a href="http://www.cppblog.com/goal00001111/archive/2007/10/21/16070.html#34761#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 二叉排序树的删除</title><link>http://www.cppblog.com/goal00001111/archive/2007/10/15/8150.html#34260</link><dc:creator>csuzl</dc:creator><author>csuzl</author><pubDate>Mon, 15 Oct 2007 04:48:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2007/10/15/8150.html#34260</guid><description><![CDATA[二叉排序树删除节点<br>   Status DeleteBST(BiTree &amp;T, Keytype key,Bitree f)    //引进f为T的父节点<br>   {<br>     if(!T) return FALSE;<br>     else<br>     {<br>       if(EQ(key,T-&gt;data.key))<br>         return Delete(T,f);<br>       else <br>          if(LT(key,T-&gt;data.key))<br>          {<br>            f = T;<br>            return DeleteBST(T-&gt;lchild,key,f);<br>           }<br><br>          else<br>          {<br>            f = T;<br>            return DeleteBST(T-&gt;rchile,key);<br>           }<br>          <br>      }<br>    }<br>  <br>   Status Delete(Bitree &amp;p,Bitree f)<br>   {<br>     if(!p-&gt;rchild)<br>     {<br>       if(p==f-&gt;lchild)<br>         f-&gt;lchild = p-&gt;lchild;<br>       else<br>         f-&gt;rchild = p-&gt;rchild;<br>       free(p); <br>      }<br>     else if(!p-&gt;lchild)<br>     {<br>        if(f-&gt;lchild==p)<br>         f-&gt;lchild = p-&gt;rchild;<br>        else<br>         f-&gt;rchild = p-&gt;rchild;<br>        free(q);<br>     }<br>     else<br>     {<br>       BiTree q = p,s = p-&gt;rchild;<br>       while(s-&gt;lchild)<br>       {<br>         q = s;<br>         s = s-&gt;lchild;   //  利用二叉排序树的前驱后继直观图帮助理解         <br>       }          //探索p的直接前驱，最后得到其为s(s-&gt;lchild==NULL).<br>       p-&gt;data = s-&gt;data;    //覆盖，容易理解<br>       if(q==p)   // while未执行，有s=p-&gt;rchild,s覆盖p,s位置由s-&gt;rchild占据．<br>        q-&gt;rchild = s-&gt;rchild;　　<br>       else 　　　　　　　//　　　未执行else前有,q-&gt;lchild=s;<br>        q-&gt;lchild = s-&gt;rchild;　<br>       free(s);<br>     }<br><br>最后else部分亦可更改为:<br>     else                           //利用直接前驱s替代p<br>     {<br>        BiTree q = p,s = p-&gt;lchild;<br>        while(s-&gt;rchild)<br>       {<br>         q = s;<br>         s = s-&gt;rchild;<br>        }             //探索p的直接前驱，最后得到其前驱为s(s-&gt;rchild==NULL).<br>        p-&gt;data =s-&gt;data;          <br>        if(q==p)<br>         q-&gt;lchild = s-&gt;lchild;<br>        else<br>         q-&gt;rchild = s-&gt;lchild;<br>        free(s);<br>      }      <br><br>    }<br><br><img src ="http://www.cppblog.com/goal00001111/aggbug/34260.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">csuzl</a> 2007-10-15 12:48 <a href="http://www.cppblog.com/goal00001111/archive/2007/10/15/8150.html#34260#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 汉诺塔非递归算法</title><link>http://www.cppblog.com/goal00001111/archive/2007/09/20/8252.html#32545</link><dc:creator>mfkxowvfp</dc:creator><author>mfkxowvfp</author><pubDate>Thu, 20 Sep 2007 07:06:00 GMT</pubDate><guid>http://www.cppblog.com/goal00001111/archive/2007/09/20/8252.html#32545</guid><description><![CDATA[能给出具体的理论验证吗？<img src ="http://www.cppblog.com/goal00001111/aggbug/32545.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/goal00001111/" target="_blank">mfkxowvfp</a> 2007-09-20 15:06 <a href="http://www.cppblog.com/goal00001111/archive/2007/09/20/8252.html#32545#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>