﻿<?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++博客-高性能服务器开发-最新评论</title><link>http://www.cppblog.com/TheLast/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Sun, 13 May 2012 06:16:08 GMT</pubDate><lastBuildDate>Sun, 13 May 2012 06:16:08 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 基础排序查找算法[未登录]</title><link>http://www.cppblog.com/TheLast/archive/2011/08/25/153878.html#154328</link><dc:creator>Chipset</dc:creator><author>Chipset</author><pubDate>Thu, 25 Aug 2011 05:24:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2011/08/25/153878.html#154328</guid><description><![CDATA[@过路客<br>除了考试这种二分查找哪里用上了，我见识短浅，拜托您举个例子吧:-)<br><br>当随机查找一个值时通常用哈希，不需要二分查找，因为二分查找跟哈希比起来慢多了，如果各个元素之间需要保持相对顺序的话(假设可能有重复的)，通常是查找上界或下界，用的是楼主这个二分查找的变形版本(看看STL lower_bound和upper_bound以及equal_range)，而这个既非找上界也非找下界的二分查找在实际应用中几乎就是个废物！<img src ="http://www.cppblog.com/TheLast/aggbug/154328.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">Chipset</a> 2011-08-25 13:24 <a href="http://www.cppblog.com/TheLast/archive/2011/08/25/153878.html#154328#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 基础排序查找算法</title><link>http://www.cppblog.com/TheLast/archive/2011/08/22/153878.html#154074</link><dc:creator>过路客</dc:creator><author>过路客</author><pubDate>Mon, 22 Aug 2011 09:48:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2011/08/22/153878.html#154074</guid><description><![CDATA[@Chipset<br><br>这种二分查找除了考试几乎没有一点实用价值??????????????? 上层做多的人一般会这么回复<br><img src ="http://www.cppblog.com/TheLast/aggbug/154074.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">过路客</a> 2011-08-22 17:48 <a href="http://www.cppblog.com/TheLast/archive/2011/08/22/153878.html#154074#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 基础排序查找算法</title><link>http://www.cppblog.com/TheLast/archive/2011/08/19/153878.html#153894</link><dc:creator>向振伟</dc:creator><author>向振伟</author><pubDate>Fri, 19 Aug 2011 15:07:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2011/08/19/153878.html#153894</guid><description><![CDATA[不全啊<img src ="http://www.cppblog.com/TheLast/aggbug/153894.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">向振伟</a> 2011-08-19 23:07 <a href="http://www.cppblog.com/TheLast/archive/2011/08/19/153878.html#153894#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 基础排序查找算法[未登录]</title><link>http://www.cppblog.com/TheLast/archive/2011/08/19/153878.html#153883</link><dc:creator>Chipset</dc:creator><author>Chipset</author><pubDate>Fri, 19 Aug 2011 13:26:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2011/08/19/153878.html#153883</guid><description><![CDATA[这种二分查找除了考试几乎没有一点实用价值。通常使用的二分查找用于找一个序列的上界或下界。请到我主页上看看原地归并排序，有二分查找的相关代码。<br><br>用第一个元素做支点进行划分，请想一想当待排序序列为逆序时它将退化成冒泡排序，那会有多慢吧？就算用随机序列，这种快速排序恐怕也慢的不能接受，请到我主页上看看快速排序的前两个版本怎么设计的，就算最慢的原始版本(第3个版本)，相信也会比你的这种快排快得多。<br><br>唉，可恶的中国计算机教育啊，误人子弟一批又一批，不知道还会继续多少批...<img src ="http://www.cppblog.com/TheLast/aggbug/153883.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">Chipset</a> 2011-08-19 21:26 <a href="http://www.cppblog.com/TheLast/archive/2011/08/19/153878.html#153883#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 哈希数据库 -- Tokyo Cabinet </title><link>http://www.cppblog.com/TheLast/archive/2011/08/19/112978.html#153879</link><dc:creator>Chipset</dc:creator><author>Chipset</author><pubDate>Fri, 19 Aug 2011 11:47:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2011/08/19/112978.html#153879</guid><description><![CDATA[@兵临城下<br>这个速度是存取一条记录的还是存取1百万条的？<br>多CPU场合加速比怎么样？<img src ="http://www.cppblog.com/TheLast/aggbug/153879.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">Chipset</a> 2011-08-19 19:47 <a href="http://www.cppblog.com/TheLast/archive/2011/08/19/112978.html#153879#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 哈希数据库 -- Tokyo Cabinet </title><link>http://www.cppblog.com/TheLast/archive/2011/07/16/112978.html#151185</link><dc:creator>网站seo优化</dc:creator><author>网站seo优化</author><pubDate>Sat, 16 Jul 2011 10:55:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2011/07/16/112978.html#151185</guid><description><![CDATA[呵呵，很棒啊，欢迎回访啊<img src ="http://www.cppblog.com/TheLast/aggbug/151185.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">网站seo优化</a> 2011-07-16 18:55 <a href="http://www.cppblog.com/TheLast/archive/2011/07/16/112978.html#151185#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 网站架构演变体系</title><link>http://www.cppblog.com/TheLast/archive/2010/04/27/112786.html#113731</link><dc:creator>向往</dc:creator><author>向往</author><pubDate>Tue, 27 Apr 2010 11:22:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2010/04/27/112786.html#113731</guid><description><![CDATA[好文<img src ="http://www.cppblog.com/TheLast/aggbug/113731.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">向往</a> 2010-04-27 19:22 <a href="http://www.cppblog.com/TheLast/archive/2010/04/27/112786.html#113731#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 哈希数据库 -- Tokyo Cabinet </title><link>http://www.cppblog.com/TheLast/archive/2010/04/20/112978.html#113059</link><dc:creator>阿福</dc:creator><author>阿福</author><pubDate>Tue, 20 Apr 2010 04:46:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2010/04/20/112978.html#113059</guid><description><![CDATA[这玩意儿并没有它所说的那么好……<img src ="http://www.cppblog.com/TheLast/aggbug/113059.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">阿福</a> 2010-04-20 12:46 <a href="http://www.cppblog.com/TheLast/archive/2010/04/20/112978.html#113059#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 哈希数据库 -- Tokyo Cabinet </title><link>http://www.cppblog.com/TheLast/archive/2010/04/20/112978.html#113049</link><dc:creator>兵临城下</dc:creator><author>兵临城下</author><pubDate>Tue, 20 Apr 2010 02:36:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2010/04/20/112978.html#113049</guid><description><![CDATA[谢谢提醒，没有注意此处，根据官方的测试：以哈希方式100w条记录，写入需要0.402秒，读取需要0.334秒。<br><br><img src ="http://www.cppblog.com/TheLast/aggbug/113049.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">兵临城下</a> 2010-04-20 10:36 <a href="http://www.cppblog.com/TheLast/archive/2010/04/20/112978.html#113049#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 哈希数据库 -- Tokyo Cabinet </title><link>http://www.cppblog.com/TheLast/archive/2010/04/19/112978.html#112987</link><dc:creator>giscn</dc:creator><author>giscn</author><pubDate>Mon, 19 Apr 2010 07:01:00 GMT</pubDate><guid>http://www.cppblog.com/TheLast/archive/2010/04/19/112978.html#112987</guid><description><![CDATA[&quot;写入100万条数据只需0.643秒，读取100万条数据只需0.773秒&quot;  ----每条数据有多大，总数据量有多大？<img src ="http://www.cppblog.com/TheLast/aggbug/112987.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/TheLast/" target="_blank">giscn</a> 2010-04-19 15:01 <a href="http://www.cppblog.com/TheLast/archive/2010/04/19/112978.html#112987#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>