Multiple Choice
What kind of performance can you expect if you perform 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 than ⁿ² in this case
E) none of the above
Correct Answer:

Verified
Correct Answer:
Verified
Q2: A reference variable can refer to any
Q14: Demonstrate how the following array is sorted
Q14: Write an insertion sort method to sort
Q34: A method's parameter can be polymorphic, giving
Q38: The GUI should react whenever the JButton
Q40: Which of the following GUI components would
Q42: An interface name can be used to
Q46: Why would you not need to implement
Q48: Comparing the amount of memory required by
Q49: Both the Insertion Sort and the Selection