<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Binary Search on BenzHub</title><link>https://benzhub.github.io/tags/binary-search/</link><description>Recent content in Binary Search on BenzHub</description><generator>Hugo</generator><language>zh-TW</language><lastBuildDate>Sun, 21 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://benzhub.github.io/tags/binary-search/index.xml" rel="self" type="application/rss+xml"/><item><title>二分搜尋 — Binary Search 三種模板與二分答案技巧 | 資料結構與演算法</title><link>https://benzhub.github.io/post/javascript/data-structures--algorithms/008-binary-search/</link><pubDate>Sun, 21 Jun 2026 00:00:00 +0000</pubDate><guid>https://benzhub.github.io/post/javascript/data-structures--algorithms/008-binary-search/</guid><description>&lt;blockquote&gt;
&lt;p&gt;&lt;strong&gt;二分搜尋（Binary Search）&lt;/strong&gt; 是面試中最常考、卻也最容易在邊界條件上翻車的演算法。掌握三種模板的不變量、理解 &lt;strong&gt;二分答案&lt;/strong&gt; 的思維轉換，你會發現這個看似簡單的技法能解決一大類「在有序空間上找邊界」的難題。&lt;/p&gt;
&lt;/blockquote&gt;</description></item></channel></rss>