﻿<?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++博客-I Will Never Stop~-最新评论</title><link>http://www.cppblog.com/NobleQiao/CommentsRSS.aspx</link><description>Qt</description><language>zh-cn</language><pubDate>Thu, 10 Mar 2011 09:43:44 GMT</pubDate><lastBuildDate>Thu, 10 Mar 2011 09:43:44 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 发一个二分查找的递归版本int B_search(int a[],int key,int size)</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/13/129518.html#129703</link><dc:creator>乔宁博(noble qiao)</dc:creator><author>乔宁博(noble qiao)</author><pubDate>Tue, 12 Oct 2010 23:46:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/13/129518.html#129703</guid><description><![CDATA[对你说的那个haskell还不太了解，去学习学习@陈梓瀚(vczh)<br><img src ="http://www.cppblog.com/NobleQiao/aggbug/129703.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">乔宁博(noble qiao)</a> 2010-10-13 07:46 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/13/129518.html#129703#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 发一个二分查找的递归版本int B_search(int a[],int key,int size)</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129613</link><dc:creator>陈梓瀚(vczh)</dc:creator><author>陈梓瀚(vczh)</author><pubDate>Tue, 12 Oct 2010 08:17:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129613</guid><description><![CDATA[@schindlerlee<br>当然如果是haskell的话，他会发现然后帮你处理成非递归的，所以可以写……<img src ="http://www.cppblog.com/NobleQiao/aggbug/129613.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">陈梓瀚(vczh)</a> 2010-10-12 16:17 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129613#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 发一个二分查找的递归版本int B_search(int a[],int key,int size)</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129588</link><dc:creator>schindlerlee</dc:creator><author>schindlerlee</author><pubDate>Tue, 12 Oct 2010 03:13:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129588</guid><description><![CDATA[@陈梓瀚(vczh)<br>哦。。这个意思啊。。<br><img src ="http://www.cppblog.com/NobleQiao/aggbug/129588.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">schindlerlee</a> 2010-10-12 11:13 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129588#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 发一个二分查找的递归版本int B_search(int a[],int key,int size)</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129585</link><dc:creator>陈梓瀚(vczh)</dc:creator><author>陈梓瀚(vczh)</author><pubDate>Tue, 12 Oct 2010 03:05:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129585</guid><description><![CDATA[@schindlerlee<br>因为写成递归的话，空间复杂度会从O(1)上升到O(lgn)，是不行的。<img src ="http://www.cppblog.com/NobleQiao/aggbug/129585.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">陈梓瀚(vczh)</a> 2010-10-12 11:05 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129585#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 发一个二分查找的递归版本int B_search(int a[],int key,int size)</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129579</link><dc:creator>schindlerlee</dc:creator><author>schindlerlee</author><pubDate>Tue, 12 Oct 2010 02:48:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129579</guid><description><![CDATA[@陈梓瀚(vczh)<br>什么意思？为啥不能写成递归的？<img src ="http://www.cppblog.com/NobleQiao/aggbug/129579.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">schindlerlee</a> 2010-10-12 10:48 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129579#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 发一个二分查找的递归版本int B_search(int a[],int key,int size)</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129573</link><dc:creator>陈梓瀚(vczh)</dc:creator><author>陈梓瀚(vczh)</author><pubDate>Tue, 12 Oct 2010 02:30:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129573</guid><description><![CDATA[C++函数如果是尾递归是不能写成递归的……这个递归版本只有在haskell和类似语言上才有意义。<img src ="http://www.cppblog.com/NobleQiao/aggbug/129573.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">陈梓瀚(vczh)</a> 2010-10-12 10:30 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/12/129518.html#129573#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 发一个归并排序的递归实现</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/11/128229.html#129519</link><dc:creator>乔宁博</dc:creator><author>乔宁博</author><pubDate>Mon, 11 Oct 2010 15:54:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/11/128229.html#129519</guid><description><![CDATA[thanks,man~@JonsenElizee<br><img src ="http://www.cppblog.com/NobleQiao/aggbug/129519.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">乔宁博</a> 2010-10-11 23:54 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/11/128229.html#129519#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 发一个归并排序的递归实现</title><link>http://www.cppblog.com/NobleQiao/archive/2010/10/10/128229.html#129379</link><dc:creator>JonsenElizee</dc:creator><author>JonsenElizee</author><pubDate>Sun, 10 Oct 2010 15:18:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/10/10/128229.html#129379</guid><description><![CDATA[It's really a nice one.<img src ="http://www.cppblog.com/NobleQiao/aggbug/129379.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">JonsenElizee</a> 2010-10-10 23:18 <a href="http://www.cppblog.com/NobleQiao/archive/2010/10/10/128229.html#129379#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 创建win32透明窗体</title><link>http://www.cppblog.com/NobleQiao/archive/2010/05/27/106677.html#116481</link><dc:creator>流光</dc:creator><author>流光</author><pubDate>Thu, 27 May 2010 08:52:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/05/27/106677.html#116481</guid><description><![CDATA[你找到新方法了，发出来大家学习学习@啊<br><img src ="http://www.cppblog.com/NobleQiao/aggbug/116481.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">流光</a> 2010-05-27 16:52 <a href="http://www.cppblog.com/NobleQiao/archive/2010/05/27/106677.html#116481#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 创建win32透明窗体</title><link>http://www.cppblog.com/NobleQiao/archive/2010/05/22/106677.html#116103</link><dc:creator>啊</dc:creator><author>啊</author><pubDate>Sat, 22 May 2010 08:24:00 GMT</pubDate><guid>http://www.cppblog.com/NobleQiao/archive/2010/05/22/106677.html#116103</guid><description><![CDATA[网上搜索，都就这一个方法，拷贝来拷贝去，没一点创意<img src ="http://www.cppblog.com/NobleQiao/aggbug/116103.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NobleQiao/" target="_blank">啊</a> 2010-05-22 16:24 <a href="http://www.cppblog.com/NobleQiao/archive/2010/05/22/106677.html#116103#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>