Analysis of insertion sort (article) | Khan Academy
https://www.khanacademy.org/computing/computer-science/algorithms/insertion-sort/a/analysis-of-insertion-sort
WEBLike selection sort, insertion sort loops over the indices of the array. It just calls insert on the elements at indices 1, 2, 3, …, n − 1 . Just as each call to indexOfMinimum took an amount of time that depended on the size of the sorted subarray, so does each call to insert.
DA: 59 PA: 69 MOZ Rank: 34