Obituary, Tony Hoare

I knew him when he was in Oxford and regularly came across him in conferences and seminars. #Quicksort was revolutionary, and #CSP had a profound effect on my thinking and technical analysis. He was always self deprecating and very approachable.

Edit an embarrassing spelling SNAFU

https://www.theregister.com/2026/03/12/in_memoriam_sir_tony_hoare/

#TonyHoare #ComputerScience #DiscreteMathematics #Obituary

Quicksort inventor Tony Hoare reaches the base case at 92

Obit: Classicist, philosopher, wit, and one of the greatest British computer scientists of all time

The Register
The architect of modern computing: Tony Hoare remembered at 92

Computer scientist Tony Hoare, who developed Quicksort and formal verification methods that shaped modern computing, has died aged 92.

The Daily Perspective

Extended material for #Python training. Added #SPDX classifier, and #Quicksort as sort algorithm

https://github.com/hofmannedv/training-python

Commemorating Tony Hoare, Inventor of QuickSort

Programming book reviews, programming tutorials,programming news, C#, Ruby, Python,C, C++, PHP, Visual Basic, Computer book reviews, computer history, programming history, joomla, theory, spreadsheets and more.

Tony Hoare, Turing Award-Winning Computer Scientist Behind QuickSort, Dies At 92 - Slashdot

Tony Hoare, the Turing Award-winning pioneer who created the Quicksort algorithm, developed Hoare logic, and advanced theories of concurrency and structured programming, has died at age 92. News of his passing was shared today in a blog post. The site I Programmer also commemorated Hoare in a post...

🚨 Breaking News: A genius who invented things no one understands has left the building! 🤔🔍 Let's all pretend we're familiar with "quicksort" and "Hoare logic" until the next tech buzzword distracts us. 🎉
https://blog.computationalcomplexity.org/2026/03/tony-hoare-1934-2026.html #BreakingNews #GeniusInventor #TechBuzzwords #Quicksort #HoareLogic #HackerNews #ngated
Tony Hoare (1934-2026)

Turing Award winner and former Oxford professor  Tony Hoare passed away last Thursday at the age of 92. Hoare is famous for quicksort, ALGO...

I just completed "Cafeteria" - Day 5 of #AdventOfCode in #TurboPascal, but only in #dosbox for the moment, not on the #Xi8088 because I'm at work 😅

Again, 8087 to the rescue!

I can't wait to see how long it will take on the real hardware, probably only a few seconds.

Did you know that #Pascal does not provide any procedure to sort the content of an array? Turbo Pascal did come with a very helpful example of a #QuickSort implementation as a reference, though.

#Retrocomputing #DOScember

🛠️🔧 Ah, the Quicksort: because nothing screams "efficient algorithm" like assembling a bookshelf without the instructions written in words 📜. Who knew the secret to avoiding bad runtime was just a Swedish-sounding random choice? IKEA: where sorting your life out is as easy as assembling a Fjällbo. 🎉
https://idea-instructions.com/quick-sort/ #Quicksort #SortingAlgorithms #IKEA #Efficiency #Algorithm #BookshelfAssembly #HackerNews #ngated
KVICK SÖRT

Quicksort is an efficient sorting algorithm based on a divide and conquer approach. Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.

KVICK SÖRT

Quicksort is an efficient sorting algorithm based on a divide and conquer approach. Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.

Some struggle with recursion, but as package invocation\_tree visualizes the Python call tree in real-time, it gets easy to understand what is going on and to debug any remaining issues.

See this one-click Quick Sort demo in the Invocation Tree Web Debugger:
https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/quick_sort.py&timestep=0.5&play

#python #programming #invocation_tree #quicksort