Multiple Choice
What kind of performance can you expect if you perform a linear search on a sorted array?
A) The performance will be about the same as on an unsorted array.
B) The performance will be much better than on an unsorted array.
C) The performance will be much worse than on an unsorted array.
D) The performance will be worse by about n^2 in this case
E) None of these
Correct Answer:

Verified
Correct Answer:
Verified
Q2: A reference variable can refer to any
Q3: One of the advantages of the linear
Q4: Code Example Ch 10-1<br>An int array
Q5: Polymorphism is achieved by<br>A) overloading<br>B) overriding<br>C) embedding<br>D)
Q6: The type of the reference, not the
Q8: We compare sorting algorithms by examining<br>A) the
Q9: A GUI control that allows the user
Q10: Both the insertion sort and the selection
Q11: Java allows one to create polymorphic references
Q12: Can a program exhibit polymorphism if it