The insertion, bubble, and selection sort algorithms are all examples of algorithms that have what big-O notation run times?
A) O(n log n)
B) O(n^n)
C) O(n**2)
D) O(n**3)

Question

Quizplus · Accepted Answer

The insertion sort, bubble sort, and selection sort algorithms all have a worst-case time complexity of O(n^2). While they may perform better on small datasets, as the input size increases, the time required to complete the sort grows quadratically. Therefore, the correct answer is C, O(n^2).

The Insertion, Bubble, and Selection Sort Algorithms Are All Examples