We say that a sorting algorithm is in situ if it sorts the items (usually in an array) without using additional temporary space to hold data. Examples of in situ sorting algorithms for arrays include selection sort, insertion sort, bubblesort, Shell sort, quicksort, and heapsort.