If the array is already sorted, what is the performance of insertion sort? A) O(n) B) O(n²) C) O(log n) D) O(n log n)

Name: If the array is already sorted, what is the performance of insertion sort? A) O(n) B) O(n 2 ) C) O(log n) D) O(n log n)
Brand: Quizplus
Rating: 4.9 (38 reviews)

Question

Quizplus · Accepted Answer

Insertion sort has a best-case performance of O(n) when the array is already sorted, as it only requires a single pass through the array to confirm the order.

If the Array Is Already Sorted, What Is the Performance