<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Binary Search]]></title><description><![CDATA[Binary Search]]></description><link>https://binary-search1.hashnode.dev</link><generator>RSS for Node</generator><lastBuildDate>Fri, 11 Sep 2026 20:19:55 GMT</lastBuildDate><atom:link href="https://binary-search1.hashnode.dev/rss.xml" rel="self" type="application/rss+xml"/><language><![CDATA[en]]></language><ttl>60</ttl><item><title><![CDATA[What is Binary Search?

Binary Search is an algorithm used to find an element in a sorted array.

Instead of checking each element one by one]]></title><description><![CDATA[Why is Binary Search Efficient?
Let’s compare:




AlgorithmTime Complexity



Linear SearchO(n)

Binary SearchO(log n)]]></description><link>https://binary-search1.hashnode.dev/what-is-binary-search-binary-search-is-an-algorithm-used-to-find-an-element-in-a-sorted-array-instead-of-checking-each-element-one-by-one</link><guid isPermaLink="true">https://binary-search1.hashnode.dev/what-is-binary-search-binary-search-is-an-algorithm-used-to-find-an-element-in-a-sorted-array-instead-of-checking-each-element-one-by-one</guid><category><![CDATA[Binary Search Algorithm]]></category><dc:creator><![CDATA[Shivam Garg]]></dc:creator><pubDate>Wed, 18 Feb 2026 03:56:07 GMT</pubDate><content:encoded><![CDATA[<h2 id="heading-why-is-binary-search-efficient">Why is Binary Search Efficient?</h2>
<p>Let’s compare:</p>
<div class="hn-table">
<table>
<thead>
<tr>
<td>Algorithm</td><td>Time Complexity</td></tr>
</thead>
<tbody>
<tr>
<td>Linear Search</td><td>O(n)</td></tr>
<tr>
<td>Binary Search</td><td>O(log n)</td></tr>
</tbody>
</table>
</div>]]></content:encoded></item></channel></rss>