Quicksort Basic implementation of the efficient sorting algorithm Quicksort. The average runtime should be O(n log n)! as the pivot is simply using the element in the middle of the array. Easy to understand example of the divide and conquer principle.