My Collection #1

Quiz:
Insertion Sort QuizQuizPublic Unlisted

Quiz:Insertion Sort Quiz

Insertion Sort Quiz

1.What is the Big O time complexity for Insertion Sort when it is given a perfectly pre-sorted array?

2.When Insertion Sort processes an already sorted array of size `n`, how many comparisons does it perform in total?

3.How many shifts (or swaps) occur during the best-case execution of Insertion Sort?

4.What does the worst-case array look like for Insertion Sort?

5.In the worst-case scenario, the total number of comparisons and shifts follows which mathematical formula for an array of size `n`?

6.What is the Big O time complexity for Insertion Sort in the worst-case scenario?

7.If you double the size of an array, what happens to the sorting time for Insertion Sort in the worst-case scenario?

8.True or False: An average, randomly shuffled array will sort much faster than the worst-case O(n²) time.

9.When running Insertion Sort on the worst-case array `[4, 3, 2, 1]`, how many comparisons and shifts are needed to place the element `1` into its correct spot?

10.Why does Insertion Sort perform so efficiently on an already sorted array?

All done? Get your grade