What is the average-case running time of insertion sort, bubble sort, and selection sort when sorting a single-dimensional array of size n? A) O( n ) B) O( log n ) C) O( 1 ) D) O( n² )

Question

Quizplus · Accepted Answer

The average-case running time for insertion sort, bubble sort, and selection sort is O(n^2) because each algorithm typically involves nested loops that iterate over the array, leading to quadratic time complexity.

What Is the Average-Case Running Time of Insertion Sort, Bubble