Insertion Sort Practice

You are using the Insertion Sort algorithm on the following array:

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9,10],[3,26,18,1,27,10,3,46,5,2,5]]$

Draw the array after the first pass:

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9,10],[,,,,,,,,,,]]$

Draw the array after the second pass:

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9,10],[,,,,,,,,,,]]$

Draw the array after the third pass:

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9,10],[,,,,,,,,,,]]$

Draw the array after the fourth pass:

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9,10],[,,,,,,,,,,]]$

Draw the array after the fifth pass:

$\backslash$table$[[0,1,2,2,4,,9,10],[,,,,,,,]]$