In-place algorithm

In computer programming, work-in-place is a technique requring no extra memory space to when manipulating the order of lists, mostly sorting. In languages that automatically manages memory space for lists, the distinction between code with work-in-place and code without it is meaningless.

See Quicksort article for an example.

Sort algorithms that can be written using work-in-place include:

• Bubble sort
• Comb sort
• Selection sort
• insertion sort
• Heapsort
• Smoothsort
• Quicksort
• Shell sort