I have run timing tests for in place and non in-place quicksorts in python.
They both seem to have an average time complexity of n(log(n)). But what makes one better than
