How does insertion sort work to sort an array? Insertion Sort finds the lowest value in an array and shifts all elements to the right of that value. Insertion Sort iterates through each index and swaps the current index with the minimum value that exists in the indices greater than the current index. Insertion Sort sets the first index as sorted, and shifts each subsequent value into the correct position by finding the lowest value on the sorted side of the array at indices lower than the current index. Insertion Sort swaps the first value of an array with the last index of an array, then swaps the second value in an array with the second to last value, until all values have swapped places. Check