Understanding Insertion Sort Algorithm

What is the primary purpose of the insertion sort algorithm?

• To quickly sort large data sets

• To insert each item into its correct position in a data set one at a time

• To create a new list from an existing one

• To compare each item with all other items

At what index does the outer for loop start in the insertion sort algorithm?

• 1

• 0

• 2

• -1

What happens if the items are out of order in the insertion sort?

• The items are moved up one space

• The items are swapped

• The algorithm stops

• The algorithm restarts

What is stored in the 'current' variable in the insertion sort algorithm?

• The initial unsorted list

• The index of the next item

• The value of the item being sorted

• The final sorted list

What condition must be met to enter the inner while loop in the insertion sort?

• There are no more items to sort

• The list is fully sorted

• Index is greater than zero and the previous item is greater than the current item

• The current item is the smallest

What is the role of 'index 2' in the insertion sort algorithm?

• It holds the value of the current item

• It tracks the current position in the list

• It determines when to exit the inner while loop

• It stores the length of the list

What type of data structure is initially used to store the items in the insertion sort example?

• Queue

• Stack

• Array

• Linked list

What is a major inefficiency of the insertion sort when dealing with large data sets?

• The need for recursive calls

• Having to update pointers

• Requiring additional memory space

• Having to move all items to insert a single item

What alternative data structure could potentially improve the efficiency of insertion sort?

• Array

• Linked list

• Binary tree

• Graph

What does the final step of the outer for loop in the insertion sort do?

• It shuffles the items randomly

• It resets the loop counter

• It checks if the list is sorted

• It places the current item into its final location