﻿<?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++博客-zhuxin-文章分类-数据结构和算法</title><link>http://www.cppblog.com/zhuxin/category/20117.html</link><description /><language>zh-cn</language><lastBuildDate>Sun, 04 Nov 2012 11:49:52 GMT</lastBuildDate><pubDate>Sun, 04 Nov 2012 11:49:52 GMT</pubDate><ttl>60</ttl><item><title>二分查找</title><link>http://www.cppblog.com/zhuxin/articles/193640.html</link><dc:creator>zhuxin</dc:creator><author>zhuxin</author><pubDate>Sun, 21 Oct 2012 15:48:00 GMT</pubDate><guid>http://www.cppblog.com/zhuxin/articles/193640.html</guid><wfw:comment>http://www.cppblog.com/zhuxin/comments/193640.html</wfw:comment><comments>http://www.cppblog.com/zhuxin/articles/193640.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/zhuxin/comments/commentRss/193640.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zhuxin/services/trackbacks/193640.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;在计算机科学中，折半搜索，也称二分查找算法、二分搜索，是一种在有序数组中查找某一特定元素的搜索算法。搜素过程从数组的中间元素开始，如果中间元素正好是要查找的元素，则搜素过程结束；如果某一特定元素大于或者小于中间元素，则在数组大于或小于中间元素的那一半中查找，而且跟开始一样从中间元素开始比较。如果在某一步骤数组为空，则代表找不到...&nbsp;&nbsp;<a href='http://www.cppblog.com/zhuxin/articles/193640.html'>阅读全文</a><img src ="http://www.cppblog.com/zhuxin/aggbug/193640.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhuxin/" target="_blank">zhuxin</a> 2012-10-21 23:48 <a href="http://www.cppblog.com/zhuxin/articles/193640.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>