Algorithmen I, SS 2014, gehalten am 14.05.2014
Author
Peter Sanders, Julian Arz, Timo Bingmann
Participating institute
Genre
Description
Vorlesung - Lektion 09: 5. Sortieren & Co 5.1 Einfache Sotieralgorithmen 5.2 Sortieren durch Mischen 5.3 Untere Schranken 5.4 Quicksort (erster Versuch) Übung: Anwendung von Hashing in der Computersicherheit
Duration (hh:mm:ss)
01:28:58
Series
Algorithmen I, SS 2014, Vorlesungen
Published on
23.05.2014
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 88108 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 894413 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 5338 s |
| Filename | 2014-386_hd.mp4 |
| File Size | 4.096 byte |
| Frame Rate | 25 |
| Video Bitrate | 800217 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen I, SS 2014, Vorlesungen
Episodes 1-24
of 24
