<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>proofs on Sandesh’s Garden</title><link>https://sandeshbhusal.github.io/archives/tags/proofs/</link><description>Recent content in proofs on Sandesh’s Garden</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Sat, 19 Aug 2023 00:00:00 +0000</lastBuildDate><atom:link href="https://sandeshbhusal.github.io/archives/tags/proofs/index.xml" rel="self" type="application/rss+xml"/><item><title>Binary search is Bananas!</title><link>https://sandeshbhusal.github.io/notes/binary-search/</link><pubDate>Sat, 19 Aug 2023 00:00:00 +0000</pubDate><guid>https://sandeshbhusal.github.io/notes/binary-search/</guid><description>Binary search is one of the most trivial and elegant algorithms to understand, and yet, equally easy to get wrong while implementing it. There are a couple of checkpoints,…</description></item></channel></rss>