<?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/search-algorithm/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 19:11:01 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/search-algorithm/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>费氏搜索(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>深度优先搜索(DFS)和广度优先搜索(BFS)算法，实用的节点搜索法</title><link>https://magiclen.org/cn/dfs-bfs/</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>
图(graph)是由节点(node)和边(edge)组合而成的非线性结构，如果我们想要从其中的一个节点开始，走访到其有直接或是间接连接的其它所有节点，可以依靠深度优先搜索法(DFS, Depth-first Search)或是广度优先搜索法(BFS, Breadth-first Search)来达成。]]></description><category>研究分享</category><category>Rust</category><category>算法</category><category>Rust</category><category>搜索算法</category><category>深度优先搜索</category><category>广度优先搜索</category><guid>https://magiclen.org/cn/dfs-bfs</guid><pubDate>Thu, 10 Oct 2019 12:00:01 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>写程序的基本功：搜索算法(Search Algorithm)</title><link>https://magiclen.org/cn/search-algorithm/</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>
这里所称的搜索(Search)，是指在一个已排序好或是尚未排序好的集合中，将指定元素的键值(key)或是索引值(index)搜索出来，或者是给定某个条件，在集合中搜索出符合该条件的数据。在集合内搜索元素的方法当然不会只有一种，而不同方法搜索数据的难易度、速度和其它特性自然也会有所不同。搜索算法(Search Algorithm)就是搜索数据的方法，目前已知的方法有很多，在这篇文章中将会整理本站所介...]]></description><category>研究分享</category><category>算法</category><category>字符串搜索</category><category>搜索算法</category><category>写程序的基本功</category><guid>https://magiclen.org/cn/search-algorithm</guid><pubDate>Wed, 22 May 2019 12:00:45 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>暴力字符串搜索(Brute-force Substring Search)算法，简单粗暴地在一个字符串中寻找子字符串</title><link>https://magiclen.org/cn/brute-force-substring-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>
暴力字符串搜索(Brute-force Substring Search)算法是最基本的字符串搜索算法。它可以按照原文中字符的顺序，逐一与搜索样本(pattern)进行比对，判断目前的搜索位置是否就是搜索样本存在的位置。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>字符串搜索</category><category>暴力字符串搜索</category><category>Rust</category><category>搜索算法</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/brute-force-substring-search</guid><pubDate>Mon, 20 May 2019 12:00:22 +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><item><title>线性搜索(Linear Search)算法，最基本的搜索算法</title><link>https://magiclen.org/cn/linear-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>
线性搜索(Linear Search)算法又称为循序搜索(Sequential 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/linear-search</guid><pubDate>Sun, 12 May 2019 12:00:11 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>快速选择(Quickselect)算法，快速寻找第 K 小或是第 K 大的元素</title><link>https://magiclen.org/cn/quickselect/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-660x486.png 3x" alt>
快速选择(Quickselect)算法是利用快速排序(Quick Sort)算法，在排序串行的同时，选择出串行中第 K 小或是第 K 大的元素。若我们只想要从串行中找出一个第 K 小或是第 K 大元素，使用快速选择法会比使用快速排序法来得快很多，因为前者不需要把串行的排序完整做完，平均只需线性时间即可找到结果。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>排序算法</category><category>快速选择</category><category>Rust</category><category>搜索算法</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/quickselect</guid><pubDate>Tue, 24 May 2016 21:20:12 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>Boyer-Moore-MagicLen(BM-MagicLen) 字符串搜索算法，超快速的全文搜索算法</title><link>https://magiclen.org/cn/boyer-moore-magiclen/</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>
Boyer-Moore-MagicLen 是笔者结合 Boyer-Moore-Horspool 和 Quick Search Algorithm 得出的字符串搜索算法。这篇文章会从 Boyer-Moore 算法讲起，再说明 Boyer-Moore-MagicLen 的概念、过程、程序实作与复杂度。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Boyer-Moore</category><category>Boyer-Moore-Horspool</category><category>Boyer-Moore-MagicLen</category><category>Java</category><category>JavaScript</category><category>Quick Search Algorithm</category><category>字符串搜索</category><category>Rust</category><category>搜索算法</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/boyer-moore-magiclen</guid><pubDate>Sat, 9 Apr 2016 21:19:58 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>