March 24, 2026
Quicksort of a legend
Tony Hoare and His Imprint on Computer Science
Internet mourns a humble giant who kept learning and even said sorry
TLDR: Computer science pioneer Tony Hoare died at 92, famed for a fast sorting method and a rare public apology for a “null” mistake that causes crashes. The internet mourns his brilliance and humility, debating whether that mistake defined him—or his lifelong habit of learning from it did.
Computer science lost Sir Tony Hoare, 92, the mind behind Quicksort—the fast way your phone sorts stuff—and the community is loud, teary, and a little messy. The top-voted vibe: awe at his humility. One commenter can’t get over him “sitting in the front row taking notes” even after a Turing Award (the Nobel of computing). Others share the tie-wearing legend’s poetic writing, like his recursive “magic” that made hard ideas feel human. People link to a CACM tribute and his Wikipedia page, trading favorite lines like baseball cards. Fans also love that he came from industry, studied classics, and never chased a PhD—just impact.
Then comes the spicy thread: the Null Apology. Hoare once called inventing the “null reference” (those crashy “nothing here” errors) his “billion-dollar mistake,” and the comments are split. One camp jokes they’ll forgive him because he also gave us Quicksort and CSP (a way for programs to talk safely). Another camp roasts lovingly: “He created the bug that haunts us—and apologized like a king.” Meme-watch: “Press F to pay respects,” “Sorted in O(tears),” and “front-row grandpa energy” all make appearances. Beneath the jokes, it’s clear: people are celebrating curiosity over ego, the rare genius who kept learning.
Key Points
- •Tony Hoare died at age 92 on March 5.
- •The article emphasizes Hoare’s distinctive scientific and writing style, citing his Turing lecture.
- •Hoare introduced a significant rule for reasoning about recursion in program proofs.
- •He began his career in industry and studied classics at Oxford, holding no doctorate apart from honorary degrees.
- •Quicksort is explained in detail, including partitioning with a pivot and two cursors and its typical n log n performance, influenced by Algol 60’s promotion of recursion.