We compare sorting algorithms by examining
A) the number of instructions executed by the sorting algorithm
B) the number of instructions in the algorithm itself (its length)
C) the types of loops used in the sorting algorithm
D) the amount of memory space required by the algorithm
E) whether the resulting array is completely sorted or only partially sorted

Question

Quizplus · Accepted Answer

A) Different sorting algorithms require a different number of instructions when executing. The Selection Sort for instance usually requires more instructions than the Insertion Sort. So, we compare sorting algorithms by the number of instructions that each takes to execute to sort the array. We might count the maximum number of instructions that a sorting algorithm will execute in the worst case, or the minimum number in the best case, or count on average the number of instructions executed. If two sorting algorithms require roughly the same number of instructions to sort an array, then we might also examine the amount of memory space required.

We Compare Sorting Algorithms by Examining