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^2
D) n^3
E) the insertion sort has an efficiency of n and the selection sort has an efficiency of n^2
Correct Answer:

Verified
Correct Answer:
Verified
Q5: Polymorphism is achieved by<br>A) overloading<br>B) overriding<br>C) embedding<br>D)
Q6: The type of the reference, not the
Q7: What kind of performance can you expect
Q8: We compare sorting algorithms by examining<br>A) the
Q9: A GUI control that allows the user
Q11: Java allows one to create polymorphic references
Q12: Can a program exhibit polymorphism if it
Q13: If classes C1 and C2 both implement
Q14: Write an insertion sort method to sort
Q15: Consider the code shown below. It contains