Archive | 2019

15: Algorithmen I, Übung, SS 2019, 19.06.2019

 
 

Abstract


15 | \n0:00:00 Start\n0:00:08 Ubungsblatt 7, Pseudocode\n0:02:49 4. Ubung\n0:02:52 Roadmap, Bucket Sort Spezial, Bucket Queue, Binary Radix Heap\n0:03:14 Erinnerung: Bucketsort\n0:06:46 Bucket Sort Spezial\n0:13:55 Spezielle Priority Queues\n0:14:55 Bucket Queue\n0:17:40 Binary Radix Heap\n0:22:52 Binary Radix Heap: deleteMin\n0:24:06 Binary Radix Heap\n0:25:54 Moglichkeit Ternarer Radix Heaps

Volume None
Pages None
DOI 10.5445/DIVA/2019-566
Language English
Journal None

Full Text