﻿<?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>博客园-范晨鹏的博客-最新评论</title><link>http://www.cnblogs.com/diylab/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Wed, 09 Nov 2011 13:29:18 GMT</pubDate><lastBuildDate>Wed, 09 Nov 2011 13:29:18 GMT</lastBuildDate><generator>cnblogs</generator><item><title>Re:海量数据处理：一亿个浮点数的排序算法</title><link>http://www.cnblogs.com/diylab/archive/2011/01/10/1562407.html#2007363</link><dc:creator>qoofan</dc:creator><author>qoofan</author><pubDate>Mon, 10 Jan 2011 05:14:33 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2011/01/10/1562407.html#2007363</guid><description><![CDATA[我用stl的heap实现了一下一楼的，比用分批读入qsort快了10秒左右。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">qoofan</a> 2011-01-10 13:14 <a href="http://www.cnblogs.com/diylab/archive/2011/01/10/1562407.html#2007363#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:成功修复Ｕ盘，狂喜中~哈哈哈！！！</title><link>http://www.cnblogs.com/diylab/archive/2010/10/22/564943.html#1941116</link><dc:creator>范晨鹏</dc:creator><author>范晨鹏</author><pubDate>Fri, 22 Oct 2010 11:23:59 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2010/10/22/564943.html#1941116</guid><description><![CDATA[@doooc
请参考：
搜索驱动的方法 
http://www.cnblogs.com/diylab/archive/2010/09/20/1831414.html<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">范晨鹏</a> 2010-10-22 19:23 <a href="http://www.cnblogs.com/diylab/archive/2010/10/22/564943.html#1941116#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:成功修复Ｕ盘，狂喜中~哈哈哈！！！</title><link>http://www.cnblogs.com/diylab/archive/2010/10/22/564943.html#1940484</link><dc:creator>doooc</dc:creator><author>doooc</author><pubDate>Fri, 22 Oct 2010 00:40:24 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2010/10/22/564943.html#1940484</guid><description><![CDATA[显示为：
PenDrive 1 : GOOD
Controller ID : UNKNOW
Flash 1 Capacity :   UNKNOW
Total Useable Sector : UNKNOW
Total Useable Byte :  UNKNOW

咋办？请高手指教！谢谢！！！
<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">doooc</a> 2010-10-22 08:40 <a href="http://www.cnblogs.com/diylab/archive/2010/10/22/564943.html#1940484#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:在 visio 中画E-R图</title><link>http://www.cnblogs.com/diylab/archive/2010/05/15/1281010.html#1824873</link><dc:creator>tunpishuang</dc:creator><author>tunpishuang</author><pubDate>Sat, 15 May 2010 08:10:33 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2010/05/15/1281010.html#1824873</guid><description><![CDATA[不错。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">tunpishuang</a> 2010-05-15 16:10 <a href="http://www.cnblogs.com/diylab/archive/2010/05/15/1281010.html#1824873#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:光驱弹不出来怎么办？光驱弹不出来的简易解决办法。</title><link>http://www.cnblogs.com/diylab/archive/2010/02/22/554487.html#1766481</link><dc:creator>晓哓</dc:creator><author>晓哓</author><pubDate>Mon, 22 Feb 2010 06:12:45 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2010/02/22/554487.html#1766481</guid><description><![CDATA[谢谢啦！这办法还真管用！<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">晓哓</a> 2010-02-22 14:12 <a href="http://www.cnblogs.com/diylab/archive/2010/02/22/554487.html#1766481#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:光驱弹不出来怎么办？光驱弹不出来的简易解决办法。</title><link>http://www.cnblogs.com/diylab/archive/2009/11/25/554487.html#1706934</link><dc:creator>呀呀!!</dc:creator><author>呀呀!!</author><pubDate>Wed, 25 Nov 2009 06:27:53 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2009/11/25/554487.html#1706934</guid><description><![CDATA[谢谢楼主,这办法好见效哈.<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">呀呀!!</a> 2009-11-25 14:27 <a href="http://www.cnblogs.com/diylab/archive/2009/11/25/554487.html#1706934#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:海量数据处理：一亿个浮点数的排序算法</title><link>http://www.cnblogs.com/diylab/archive/2009/10/22/1562407.html#1678719</link><dc:creator>luyeqm</dc:creator><author>luyeqm</author><pubDate>Thu, 22 Oct 2009 08:51:55 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2009/10/22/1562407.html#1678719</guid><description><![CDATA[2000万行字符串排序已经完成.

请访问:luyeqm.vip.sina.com<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">luyeqm</a> 2009-10-22 16:51 <a href="http://www.cnblogs.com/diylab/archive/2009/10/22/1562407.html#1678719#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:海量数据处理：一亿个浮点数的排序算法</title><link>http://www.cnblogs.com/diylab/archive/2009/10/20/1562407.html#1676584</link><dc:creator>范晨鹏</dc:creator><author>范晨鹏</author><pubDate>Tue, 20 Oct 2009 04:56:08 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2009/10/20/1562407.html#1676584</guid><description><![CDATA[@CUCmehp(likesmiles)
呵呵学识尚浅，对堆用得不太熟练。所以没考虑那么复杂。回访了你的博客。发现你比我的知识面广啊。 mysql，java 都是我想学而还没分配精力去学的东东。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">范晨鹏</a> 2009-10-20 12:56 <a href="http://www.cnblogs.com/diylab/archive/2009/10/20/1562407.html#1676584#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:海量数据处理：一亿个浮点数的排序算法</title><link>http://www.cnblogs.com/diylab/archive/2009/10/20/1562407.html#1676580</link><dc:creator>范晨鹏</dc:creator><author>范晨鹏</author><pubDate>Tue, 20 Oct 2009 04:50:12 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2009/10/20/1562407.html#1676580</guid><description><![CDATA[@skxzz
应该也可以。我还没仔细想。不过插入排序的话，可能涉及的内存换页操作会比较多一些。
<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">范晨鹏</a> 2009-10-20 12:50 <a href="http://www.cnblogs.com/diylab/archive/2009/10/20/1562407.html#1676580#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:海量数据处理：一亿个浮点数的排序算法</title><link>http://www.cnblogs.com/diylab/archive/2009/10/19/1562407.html#1676191</link><dc:creator>CUCmehp(likesmiles)</dc:creator><author>CUCmehp(likesmiles)</author><pubDate>Mon, 19 Oct 2009 13:43:50 GMT</pubDate><guid>http://www.cnblogs.com/diylab/archive/2009/10/19/1562407.html#1676191</guid><description><![CDATA[有序数序是维护一个大顶堆吧,存放前k大个?但k比较大的话,这个算法的时间复杂度还是不好的,因为要整堆,需要log(k)次,这样的话,比如前10000大话,每天整堆的时间最坏是14次.对每一个数插入都要这样.楼主要的算法要是partation的话,分组大小越等于2*K越好?但是分组又过多,应该有个均衡.我是这样理解的.<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/diylab/" target="_blank">CUCmehp(likesmiles)</a> 2009-10-19 21:43 <a href="http://www.cnblogs.com/diylab/archive/2009/10/19/1562407.html#1676191#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>
