If you use O(log n) space you are doing IO because n items requires n memory so most of your items are sitting someplace slow.

Quicksort requires n+c space where c is a few pointers.

https://www.cs.ox.ac.uk/files/6226/H2006%20-%20Historic%20Qu...