main page  —  CS 210 Algorithms and Data Structures

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

Further sources

This chapter is modeled after

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

Unit 6  ⋅  Syllabus  ⋅  Unit 8