In-Place Algorithms
← Back to Space Complexity
Algorithms that use only O(1) extra space beyond the input. They transform the input using only a constant amount of additional memory, making them memory-efficient but sometimes more complex to implement.
Key Properties
Related
- Auxiliary Space (general concept)
- Space-Time Tradeoffs (in-place often trades time for space)