An ongoing series of nonverbal
algorithm assembly instructions.
Permanent link: idea-instructions.com/quick-sort/
Download: PDF, PNG, SVG (notes) – License: CC by-nc-sa 4.0
Quicksort is an efficient sorting algorithm based on a “divide and conquer” approach. Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.
Initially published 2018-03-16.
IDEA is a series of nonverbal algorithm assembly instructions by Sándor P. Fekete, Sebastian Morr, and Sebastian Stiller. They were originally created for Sándor's algorithms and datastructures lecture at TU Braunschweig, but we hope they will be useful in all sorts of context. We publish them here so that they can be used by teachers, students, and curious people alike. Visit the about page to learn more.
