<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"><channel><title>MagicLen</title><link>https://magiclen.org/cn/tag/binary-search/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 19:12:44 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/binary-search/feed/" rel="self" type="application/rss+xml"/><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>如何将递归函数改成迭代函数？</title><link>https://magiclen.org/cn/recursive-to-iterative/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/mathematics-1509559_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/mathematics-1509559_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/mathematics-1509559_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/mathematics-1509559_1920-660x486.jpg 3x" alt>
递归(Recursive)函数是在运行的过程又会直接或间接地调用自己本身的函数。通常透过递归函数可以快速地验证我们的算法，用简短的代码处理复杂的问题，但是函数在调用时需要创建新的堆栈框(Stack Frame)，除了会需要额外的开支(Overhead)之外，如果在函数中调用函数，而这函数又会调用函数，持续下去，很容易就会造成堆栈溢出(Stack Overflow)。虽然有些编程语言的编译器会做尾端...]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>二元搜索</category><category>TypeScript</category><category>费氏数列</category><category>阶乘</category><category>Go</category><guid>https://magiclen.org/cn/recursive-to-iterative</guid><pubDate>Thu, 11 Jun 2020 12:00:44 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>费氏搜索(Fibonacci Search)算法，运用费氏数列的搜索算法</title><link>https://magiclen.org/cn/fibonacci-search/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
费氏搜索(Fibonacci Search)算法有点像是二元搜索(Binary Search)算法，同样是在一个已排序好的数组中搜索元素，但是它在移动数组索引值时是去参考费氏数列(Fibonacci Sequence)，而不是像二元搜索法那样总是去取索引的中间值。也由于费氏搜索法在移动数组索引值时只需要进行加减运算，不需乘、除法，因此它适合被用在不擅长处理乘、除法的 CPU 上。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>搜索算法</category><category>二元搜索</category><category>TypeScript</category><category>费氏数列</category><category>费氏搜索</category><category>Go</category><guid>https://magiclen.org/cn/fibonacci-search</guid><pubDate>Thu, 28 May 2020 12:00:15 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>插补搜索(Interpolation Search)算法，运用数据近似线来辅助搜索的算法</title><link>https://magiclen.org/cn/interpolation-search/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
插补搜索(Interpolation Search)算法又称为内插搜索算法，是二元搜索(Binary Search)算法的变体。这套算法可以在已排序好的串行中根据数据的预测线或近似线来进行高效率的搜索，近似线愈精准，搜索的效率就愈高。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>搜索算法</category><category>二元搜索</category><category>插补搜索</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/interpolation-search</guid><pubDate>Sat, 18 May 2019 12:00:32 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>指数搜索(Exponential Search)算法，搜索目标在串行愈前面就愈快的算法</title><link>https://magiclen.org/cn/exponential-search/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
指数搜索(Exponential Search)算法又称为双倍搜索(Doubling Search)算法或是蔓延搜索(Galloping Search)算法，是二元搜索(Binary Search)算法的变体。这套算法可以在已排序好的串行中进行高效率的搜索，要搜索的元素在串行中愈前面的话，搜索性能愈好。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>搜索算法</category><category>二元搜索</category><category>指数搜索</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/exponential-search</guid><pubDate>Thu, 16 May 2019 12:00:42 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>二元搜索(Binary Search)算法，简单又快速的搜索算法</title><link>https://magiclen.org/cn/binary-search/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
二元搜索(Binary Search)算法又称为二分搜索(Half-Interval Search)算法或是对数搜索(Logarithmic Search)算法，顾名思义，这套算法的核心思想就在于「二分」，可以在已排序好的串行中进行高效率的搜索。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>搜索算法</category><category>二元搜索</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/binary-search</guid><pubDate>Tue, 14 May 2019 12:00:35 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>