Schnellsortierung

Quicksort L11

Quicksort is an efficient sorting algorithm that recursively partitions data around a pivot element, dividing it into smaller subarrays, and sorting each recursively to achieve O(n log n) average performance.