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

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

Question

Quizplus · Accepted Answer

If the array is already sorted, the inner loop of insertion sort will never execute because there will be no swaps needed. Therefore, the algorithm will just iterate through the array once, resulting in a time complexity of O(n).

If the Array Is Already Sorted, What Is the Performance