Acronyms that contain the term insertion sort 

Insertion sort

Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages: ⁕Simple implementation ⁕Efficient for small data sets ⁕Adaptive for data sets that are already substantially sorted: the time complexity is O, where d is the number of inversions ⁕More efficient in practice than most other simple quadratic algorithms such as selection sort or bubble sort; the best case is O ⁕Stable; i.e., does not change the relative order of elements with equal keys ⁕In-place; i.e., only requires a constant amount O of additional memory space ⁕Online; i.e., can sort a list as it receives it When humans manually sort something, most use a method that is similar to insertion sort.

see more »