a fairly simple yet quite efficient and fast sorting method for small amounts of data

Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare that, on average, makes Θ(n log n) comparisons to sort n items.