Skip to content

Comment on A decades-old bug in Knuth's long division (TAOCP Vol II, Algorithm 4.3.1D)

Comments

This may very well be the most epic post in HN history.

EDIT : I recall fondly algorithm D... one of my first programming experiences in the 90s was trying to implement knuth's arithmetic algorithms for addition, substraction, etc. in 8086 asm. Got them right up until long multiplication (that one was a tremendous effort). Algorithm D was too formidable to even dare me attempt. Feel extremely happy to see people in 2026 looking at these algorithms closely.

It's definitely up there. However, I really do enjoy the post linked below solely because of one particular comment chain.

https://news.ycombinator.com/item?id=35015#35079

Thank you, i'm flattered!

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.