Multiple Choice
Linear search is highly inefficient compared to binary search when dealing with:
A) Small, unsorted arrays.
B) Small, sorted arrays.
C) Large, unsorted arrays.
D) Large, sorted arrays.
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: Linear search can be used on:<br>A) Unsorted
Q9: Unless otherwise specified, entire arrays are passed
Q10: Which of the following statements is false
Q11: After the i<sup>th</sup> iteration of the insertion
Q12: Which of the following is not a
Q13: A double subscripted array declared as int
Q15: In a typical nested for-loop used to
Q16: Which of the following does not declare
Q17: To prevent modification of array values passed
Q23: Which statement would be used to declare