Test your understanding of the Insertion Sort algorithm
Using Insertion Sort on this array, how does the array look like after the FIRST insertion (element 3)?
Array: [5, 3, 8, 4, 2]
Attempts: 0/3
Using Insertion Sort, what does the array look like after the SECOND insertion (element 8)?
Array: [12, 11, 13, 5, 6]
Attempts: 0/3
Insertion Sort is performed on this array. How does the array look like after it is FULLY sorted?
Array: [4, 1, 3, 9, 7]
Attempts: 0/3