Insertion sort - Wikipedia
en.wikipedia.org › wiki › Insertion_sortInsertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. 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:
Insertion Sort List - LeetCode
leetcode.com › problems › insertion-sort-listThe steps of the insertion sort algorithm: Insertion sort iterates, consuming one input element each repetition and growing a sorted output list. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the... It repeats until no input elements ...