12: Sortierte Folgen, Binäre Suche, Priority Queues, Binary Radix Heap
About this video
Editorial review · 85% confidenceRound-15 hunt: picked; source: deeper uploads from a strong round 1-9 channel; channel already live on Lumen; strict per-title check + final strict pass; title rules; oEmbed verified.
A 74-minute video from KIT Lehre und Wissen: “12: Sortierte Folgen, Binäre Suche, Priority Queues, Binary Radix Heap”.
Video by KIT Lehre und Wissen, played through YouTube's embedded player.