QuickSort Algorithm (Python)
The main single advantage of quicksort is that it sorts in-place. Your implementation does not. It requires an additional memory for left and right lists, linear in terms of the initial array length.
Returning the concatenation of the three lists also doesn't help performance.
An obvious improvement is to reimplement it in-place.