Explain 'In-place' algorithm.

Explain 'In-place' algorithm.

Approach: Describe an algorithm with minimal extra space usage.

An algorithm which transforms input using no auxiliary data structure. However, a small amount of extra storage space is allowed for auxiliary variables (usually O(1)).

Follow-up: Is Quicksort typically in-place?

Key concepts: space complexity, auxiliary space, O(1) extra space.