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.
- v1.0: Initial version
- v1.1: Change title from KWICK SÖRT to KVICK SÖRT to make it sound even more Swedish
- v1.2: Update the IDEA logo
Initially published 2018-03-16.