Sorting Using Partial Information - Robert Tarjan

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Sorting using partial information teaches algorithmic reasoning under constraints—a classic computer science problem. This covers decision tree theory and information-theoretic bounds with pedagogical value for algorithm design.

A 62-minute video from Institute for Advanced Study: “Sorting Using Partial Information - Robert Tarjan”.

Video by Institute for Advanced Study, played through YouTube's embedded player.