in-place sort

RU: сортировка на месте

A sorting algorithm that rearranges elements within the original array using O(1) or O(log n) extra space, without copying to a second array. Heapsort, insertion sort, and quicksort (call-stack aside) are in-place; merge sort in its standard form is not.