IFL 2012. Fritz Henglein: Generic sorting and partitioning in linear time and fully abstractly

José Pedro Magalhães · 3K views · 2012 · 1:07:42

Open on YouTube

Algorithms & data structuresother

Why the open web links it

Presents a novel approach to generic sorting and partitioning with linear time complexity and full abstraction.

Linked by 4 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including ycombinator.com, stackage.org, devtalks.stream, philipzucker.com.