Insertion sort
SORTING ALGORITHM THAT, AT EACH ITERATION, INSERTS THE CURRENT INPUT ELEMENT INTO THE SUITABLE POSITION BETWEEN THE ALREADY SORTED ELEMENTS
Insert sort; Insertsort; Template:Insertion sort core implementations; Linear insertion sort; Binary insertion sort; Insertionsort; Insertion Sort; List insertion
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.