15: Algorithmen I, Übung, SS 2019, 19.06.2019
Author
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Start
- 0:00:08 Übungsblatt 7, Pseudocode
- 0:02:49 4. Übung
- 0:02:52 Roadmap, Bucket Sort Spezial, Bucket Queue, Binary Radix Heap
- 0:03:14 Erinnerung: Bucketsort
- 0:06:46 Bucket Sort Spezial
- 0:13:55 Spezielle Priority Queues
- 0:14:55 Bucket Queue
- 0:17:40 Binary Radix Heap
- 0:22:52 Binary Radix Heap: deleteMin
- 0:24:06 Binary Radix Heap
- 0:25:54 Möglichkeit Ternärer Radix Heaps
Duration (hh:mm:ss)
00:27:12
Series
Algorithmen I, Vorlesung, SS 2019
Published on
25.06.2019
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 128000 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 934025 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 1632 s |
| Filename | DIVA-2019-566_hd.mp4 |
| File Size | 190.586.002 byte |
| Frame Rate | 25 |
| Video Bitrate | 799942 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen I, Vorlesung, SS 2019
Episodes 1-23
of 23
