small amount of space in addition to the sequence itself instead of transferring elements out of the sequence and then back inwe simply rearrange them we il lustrate in-place heap-sort in figure in generalwe say that sorting algorithm is in-place if it uses only small amount of memory in addition to the sequence storing the objects to be sorted figure first three steps of phase of in-place heap-sort the heap portion of the sequence is highlighted in blue we draw next to the sequence binary tree view of the heapeven though this tree is not actually constructed by the in-place algorithm