Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. In the worst case, it makes O(n2) comparisons, though this behavior is rare.
Quicksort
Quicksort
Quicksort
Institut f ur Algebra und Diskrete Mathematik
Programming Assignment 1 - Step 3
All software used at own risk - authors take no responsibility!
from Recursion to Iteration 1
Editors Implementing
Index of /~fiii/materiale_esercitazioni/AA 2009-10/Esercitazione_9
Index of /~fiii/materiale_esercitazioni/AA 2011-12/esercitazione-2011-11-25-sorting
Implementing Quicksort Programs.
Algorithm 64: Quicksort
A Practical Quicksort Algorithm for Graphics Processors
