main page — CS 210 Algorithms and Data Structures
Unit 12: Ausblick
(Unit 12 ist nicht Teil des Klausurstoffes.)
So sortiert man heute!
Forschungsvortrag unsere Arbeiten zum Sortieren in der Java Runtime Library.
- slides
- Video 12-1 (2026-07-06):
Forschungsvortrag Teil 1: Java’s Dual-Pivot Quicksort
- Video 12-2 (2026-07-06):
Forschungsvortrag Teil 2: Powersort
Übersicht Lehre der AG Algorithmik
-
Video 12-3 (2026-07-08): Übersicht Lehre der AG Algorithmik
Further sources
Highly recommended video on undecidable (uncomputable) problems
On NP-completeness, there’s few videos that are neither just mathematical lectures, nor unscientific hyperbole too vague for me to recommend. A nice mid-ground are these
-
As high-level introduction
Art of the Problem: P = NP? | Complexity Theory Explained Visually -
With some more content
hackerdashery: P vs. NP and the Computational Complexity Zoo