title: in place quick sort has O(n) or O(logn) space complexity
body: <p>This Wikipidea article <a href="http://en.wikipedia.org/wiki/Quicksort#In-place_version" rel="noreferrer">http://en.wikipedia.org/wiki/Quicksort#In-place_version</a> suggests that O(logn) is the space time complexity for in place sort and <a href="http://futur3googl3r.blogspot.com/2008/08/google-interview-questions.html" rel="noreferrer">http://futur3googl3r.blogspot.com/2008/08/google-interview-questions.html</a> this interview site suggests it is O(n). I think the answer is O(n) but wanted to know if I am right. </p>