Computing Science Insertion Sort Quiz

What is the worst-case time complexity of Insertion Sort algorithm?

• O(1)

• O(n)

• O(n^2)

• O(log n)

In Insertion Sort, which element is compared to the key element during each iteration?

• Next element in the array

• Previous element in the array

• Random element in the array

• Last element in the array

Which of the following best describes the main characteristic of Insertion Sort?

• It is a divide and conquer algorithm

• It is an in-place sorting algorithm

• It has a time complexity of O(n log n)

• It is only applicable to small datasets

During the Insertion Sort process, when is an element shifted to the right?

• When it is smaller than the key element

• When it is larger than the key element

• When it is in its correct sorted position

• When it is the first element in the array

What happens if an element in Insertion Sort is already in its correct place in the sorted array?

• It is shifted to the right until a spot is found

• It is compared with the key element again

• It remains in its place

• It is moved to the end of the array

In Insertion Sort, what is the best-case time complexity when the array is already sorted?

• O(n)

• O(n log n)

• O(n^2)

• O(1)

Which of the following sorting algorithms is Insertion Sort most similar to?

• Merge Sort

• Quick Sort

• Bubble Sort

• Heap Sort

When does the worst-case time complexity for Insertion Sort occur?

• When the array is sorted in descending order

• When the array is empty

• When all elements in the array are the same

• When the array is sorted in ascending order

What does the initial subarray look like in the first iteration of Insertion Sort?

• It contains the first element of the array

• It contains two elements of the array

• It contains the entire array

• It is empty

Which step of the Insertion Sort algorithm involves moving elements to create space for the key element?

• Comparing the key element with the previous elements

• Shifting elements to the right within the sorted subarray

• Placing the key element in its correct position

• Swapping the key element with the last element