Multiple Choice
If lower is the first subscript in a contiguous portion of an array,and upper is the last subscript,then the array item in the middle of that array portion is at subscript
A) (lower + upper) /2
B) (lower - upper./2
C) lower + upper/2
D) (upper - lower./2
Correct Answer:
Verified
Correct Answer:
Verified
Q6: The selection sort algorithm works by<br>A) repeatedly
Q7: Binary Search is in the complexity class<br>A)
Q8: Consider the following implementation of insertion sort:<br>Public
Q9: The insertion sort algorithm works by<br>A) repeatedly
Q10: A search for an item X in
Q12: A contigous segment of an array is
Q13: Assuming a method<br>Int findMax(int array[ ],int last)that
Q14: Let F be an algorithm with complexity
Q15: The binary search algorithm<br>A) cannot be used
Q16: Linear time is the class of all