Virtual Labs

What does Insertion Sort primarily do?

Divides an array into smaller parts
Compares and swaps adjacent elements
Inserts elements into their correct position
Sorts elements using recursion

What is the best-case time complexity of Insertion Sort?

O(n)
O(n²)
O(log n)
O(n log n)

When does Insertion Sort perform best?

When the array is completely unsorted
When the array is partially sorted
When the array has duplicate elements
When the array is large and random

Which of the following describes how elements are placed in Insertion Sort?

Elements are swapped during each pass
Elements are inserted into their correct position
Elements are divided into subarrays
Elements are shuffled randomly

What is the space complexity of Insertion Sort?

O(n)
O(n²)
O(1)
O(log n)

Virtual Labs

Insertion Sort Pretest

Answer the multiple-choice questions below to test your knowledge!

Multiple-Choice Questions:

Virtual Labs

Insertion Sort Pretest

Answer the multiple-choice questions below to test your knowledge!

Multiple-Choice Questions:

Rate

Bug Report