[Algorithm] In-Place

In-Place Algorithm

In computer science,
an in-place algorithm is an algorithm
that operates directly on the input data structure
without requiring extra space proportional to the input size.
In other words, it modifies the input in place,
without creating a separate copy of the data structure.

An algorithm which is not in-place
is sometimes called not-in-place or out-of-place.

Last Updated on 2023/08/16 by A1go