12: Algorithmen I, Übung, SS 2019, 05.06.2019
Author
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Start
- 0:10:03 Adaptives Sortieren
- 0:10:59 Insertion Sort: Adaptiv?
- 0:11:41 Insertion Sort: Erwartete Laufzeit
- 0:14:09 Natural Merge Sort
- 0:15:03 Erwartete Anzahl von Runs
- 0:19:51 Split Sort
- 0:22:41 Schnelle Mediansuche für Quicksort
- 0:33:01 Sortieralgorithmen in aktuellen Programmiersprachen
Duration (hh:mm:ss)
00:36:48
Series
Algorithmen I, Vorlesung, SS 2019
Published on
07.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 | 934404 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 2208 s |
| Filename | DIVA-2019-532_hd.mp4 |
| File Size | 257.909.898 byte |
| Frame Rate | 25 |
| Video Bitrate | 800362 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen I, Vorlesung, SS 2019
Episodes 1-23
of 23
