<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Algorithms on crowbar</title>
    <link>https://crowbar.team/tags/algorithms/</link>
    <description>Recent content in Algorithms on crowbar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 20 Jul 2026 02:00:00 +0000</lastBuildDate>
    <atom:link href="https://crowbar.team/tags/algorithms/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Improving Linear Search Performance Using x86 AVX</title>
      <link>https://crowbar.team/posts/linear-search-optimization/</link>
      <pubDate>Mon, 20 Jul 2026 02:00:00 +0000</pubDate>
      <guid>https://crowbar.team/posts/linear-search-optimization/</guid>
      <description>&lt;p&gt;Linear search is one of the simplest algorithms for finding a value in a sequence. It has a worst-case time complexity of \(O(n)\), making it asymptotically less efficient than algorithms such as binary search, which performs lookups in \(O(\log n)\) on sorted data.&lt;/p&gt;
&lt;p&gt;If the data is initially unsorted, however, it must first be sorted at a cost of \(O(n \log n)\). For a single lookup, this preprocessing cost makes sorting followed by binary search slower than a linear scan. Binary search becomes advantageous when the same dataset is searched repeatedly.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
