What Does Each Iteration of the Insertion Sort Algorithm Do

question 5

Multiple Choice

What does each iteration of the insertion sort algorithm do?

• A) Each iteration takes the next smallest element and inserts it at the beginning of the array.
• B) Each iteration takes the next element in the unsorted portion of the array and inserts it into the sorted portion.
• C) Sorted subarrays are inserted into the larger array.
• D) Each iteration determines the location of a pivot and inserts it into place.

---

Definitions:

Predictions

Statements about what will happen in the future based on current information or trends.

Testable

Capable of being examined and evaluated through experimentation or observation to verify the truth or effectiveness.

Hypothesis

A proposed explanation for a particular set of phenomena.

Refuted

Successfully argued against a statement or theory, proving it to be wrong or false.