Noun
insertion sort (countable and uncountable, plural insertion sorts)
(computer science) A sorting algorithm that performs its task by inserting new items into a pre-existing sorted data structure.
A good implementation of Insertion sort is fast for small arrays, stable, in-place, and can significantly speed up Radix Sort. Source: Internet
Insertion sort is widely used for small data sets, while for large data sets an asymptotically efficient sort is used, primarily heap sort, merge sort, or quicksort. Source: Internet
Insertion sort is very similar in that after the kth iteration, the first k elements in the array are in sorted order. Source: Internet
Examples Sorting algorithms seeAlso * Insertion sort applied to a list of n elements, assumed to be all different and initially in random order. Source: Internet
Insertion sort main Insertion sort is a simple sorting algorithm that is relatively efficient for small lists and mostly sorted lists, and is often used as part of more sophisticated algorithms. Source: Internet