<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>aditya motale ~ an engineer by choice</title><description>an engineer by choice</description><link>https://adii.fyi/</link><language>en-us</language><item><title>There&apos;s More to Performance Than Big-O</title><link>https://adii.fyi/blogs/theres-more-to-performance-than-big-o/</link><guid isPermaLink="true">https://adii.fyi/blogs/theres-more-to-performance-than-big-o/</guid><description>Exploring why an O(n) SIMD linear search can outperform O(log n) binary search on modern CPUs.</description><pubDate>Tue, 15 Sep 2026 00:00:00 GMT</pubDate><category>rust</category><category>algorithms</category><category>simd</category></item></channel></rss>