11: Algorithmen 1, Vorlesung und Übung, SS 2017, 31.05.2017
Author
Jörn Müller-Quade, Sascha Witt
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:00:11 Vorlesung
- 0:00:14 Heap-Algorithmus
- 0:04:52 Prozedur siftDown
- 0:12:20 deleteMin: Beispiel
- 0:15:46 Binärer Heap
- 0:27:34 Nützlicher Rechentrick
- 0:32:02 Heapsort
- 0:38:16 Heapsort, Quicksort, Mergesort
- 0:40:43 Adressierbare Prioritätslisten
- 0:40:48 Übung
- 0:41:39 Roadmap
- 0:43:44 Erinnerung: Bucketsort
- 0:44:45 Bucket Sort für [0, 1)
- 0:51:48 Priority Queues
- 0:55:18 Bucket Queue
- 0:58:09 Binary Radix Heap
- 1:12:41 Schnelle Heaps
- 1:13:58 Zusammenfassung
Duration (hh:mm:ss)
01:15:43
Series
Algorithmen I, Vorlesung, SS 2017
Published on
08.06.2017
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 101131 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 906911 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 4543 s |
| Filename | DIVA-2017-309_hd.mp4 |
| File Size | 4.096 byte |
| Frame Rate | 25 |
| Video Bitrate | 799689 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen I, Vorlesung, SS 2017
Episodes 1-23
of 23
