CS 360: Lecture 2: Insertion Sort

Insertion Sort - Sorting Algorithm Animations insertion sort Insertion sort works by inserting elements from an unsorted array into a sorted subsection of the array, one item at a time O time on averge, insertion sort Insertion Sort is a sorting algorithm that picks an element from the array , takes it out of the index it is currently in, and 'inserts' it

fountain tree resort The Insertion Sort algorithm uses one part of the array to hold the sorted values, and the other part of the array to hold values that are not sorted yet