Is imperative Quicksort in situ (in-place) or not?
问题 Quicksort is often described as an in situ (in-place) algorithm, despite the fact that it requires O(log n) stack space. So does in situ mean "requires less than O(n) additional space", or does stack space generally not count as space complexity (but why would that be the case?), or is Quicksort actually not an in situ algorithm? 回答1: is Quicksort actually not an in situ algorithm? The standard implementation of it is not in situ . It's a horribly common misconception, but you as correctly