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²
D) n³
E) Insertion sort has an efficiency of n and Selection Sort has an efficiency of n²

Question

Quizplus · Accepted Answer

C) Both sorting algorithms use two nested loops which both execute approximately n times apiece, giving a complexity of n * n or n² for both.

Both the Insertion Sort and the Selection Sort Algorithms Have