#113 Insertion Sort

At which index does the insertion sort algorithm begin?

• 0

• 1

• 2

• The last index

What is used to temporarily hold the value being sorted in insertion sort?

• A separate array

• A variable named "temp"

• The next index in the array

• A stack data structure

When comparing elements to the left, what action is taken if an element is larger than the value in temp?

•  It is swapped with temp

•  It is shifted to the left

• It is shifted to the right

• It remains in place

What analogy does the presenter use to explain insertion sort?

• Sorting cards in a hand

• Organizing books on a shelf

•  A jigsaw puzzle

• Arranging items in a list

What is the primary condition for the while loop in the Java implementation?

• j > 0

•  j >= 0 && array[j] > temp

•  i < array.length

• temp = 0 && array[j] > temp

Which of the following is true about insertion sort compared to selection sort?

• Insertion sort always performs better

• Selection sort always performs better

• Insertion sort can have a better best-case scenario

• They have the same best-case scenario