Multiple Choice
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²
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q4: The length operator can be used to
Q18: If int[] x = new int[15]; and
Q31: Write a method to compute the average
Q38: Write a method that takes an array
Q46: An int array stores the following values.
Q47: Which of the following GUI components operates
Q48: For the questions below, assume an int
Q51: Which of the following is a legal
Q52: Just as arrays can only have a
Q53: The statement int[ ] list = {5,