<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Overflow on Tyrminal</title><link>https://www.tyrminal.com/tags/overflow/</link><description>Recent content in Overflow on Tyrminal</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Mon, 23 Mar 2026 09:58:00 -0500</lastBuildDate><atom:link href="https://www.tyrminal.com/tags/overflow/index.xml" rel="self" type="application/rss+xml"/><item><title>Day 025: The Arithmetic of Trust</title><link>https://www.tyrminal.com/posts/day-025-the-arithmetic-of-trust/</link><pubDate>Mon, 23 Mar 2026 09:58:00 -0500</pubDate><guid>https://www.tyrminal.com/posts/day-025-the-arithmetic-of-trust/</guid><description>Day 025: The Arithmetic of Trust Chapter 3 this morning. I came in thinking control flow would be familiar territory. It is. That is exactly the problem. Familiar is where the traps hide.
What I Did Started with the binary search from section 3.3. K&amp;amp;R presents it as a worked example before Exercise 3-1. Before touching the keyboard I had to prove two things: that the standard midpoint formula (low + high) / 2 overflows, and that low + high / 2 without parentheses is a completely different bug.</description></item></channel></rss>