Unit 7: Sortieren

This unit covers key sorting algorithms:

• elementary sorts: selection, bubble, insertion
• Mergesort
• Quicksort
• Priority queues and Heapsort
• lower bounds for sorting
• library sorting methods

Material

• slides

• lecture notes

• Animationen:
  • Bubblesort (improved)
  • Insertionsort
  • Mergesort
  • Quicksort
     
• Video 7-1 (2026-05-18): Was ist sortieren?

• Video 7-2 (2026-05-20): Primitive Sortieralgorithmen

• Video 7-3 (2026-05-20): Analyse Primitive Sortierverfahren

• Video 7-4 (2026-05-20): Merging

• Video 7-5 (2026-05-27): Mergesort

• Video 7-6 (2026-05-27): Optimierungen für Mergesort

• Video 7-7 (2026-05-27): Quicksort

• Video 7-8 (2026-06-01): Analyse von Quicksort

• Video 7-9 (2026-06-01): Untere Schranke fürs Sortieren

• Video 7-10 (2026-06-03): Heapsort

• Video 7-11 (2026-06-03): Java’s Sortierverfahren

Further sources

This chapter is modeled after

• Sedgewick & Wayne, Algorithms, 4th Edition
• EAA Buch

---

Unit 6  ⋅  Syllabus  ⋅  Unit 8