Both the insertion sort and the selection sort algorithms have efficiencies on the order of ________ where n is the number of values in the array being sorted.
A) n
B) n * log n
C) n^2
D) n^3
E) the insertion sort has an efficiency of n and the selection sort has an efficiency of n^2

Question

Quizplus · Accepted Answer

Both insertion sort and selection sort have quadratic time complexity, which is O(n^2). This means that their efficiency is on the order of n^2, not n, n*logn, or n^3. Therefore, the best choice is option C.

Both the Insertion Sort and the Selection Sort Algorithms Have