Logarithmic Average QuickSort - Sorting algorithm visualization using SortTheater

Logarithmic Average QuickSort is a QuickSort variation that uses an approximate average (found in O(log n) time) as ghost pivot. It is meant to pick better pivots (improving performances) and to work as fast as normal on patterns.

Time complexity:
Best case = O(n)
Average/Worst case = O(n log n)

Space complexity = O(log n)