Multiple Choice
Suppose that we are searching for an item X in an array sorted in descending order.If we find that X is smaller than the middle item of the array,then we should continue our search in the half of the array whose elements
A) have higher subscripts than the middle of the array
B) have lower subscripts than the middle of the array
C) have the same subscript as the middle of the array
D) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Q36: The Quicksort algorithm<br>A) is in O(n)in the
Q37: If a[ ] is an array of
Q38: A basic step is<br>A) an operation that
Q39: If an algorithm with an input size
Q40: The role of the partition(array,start,end)method in Quicksort<br>A)
Q41: The method findMax shown below is supposed
Q42: The bubble sort algorithm works by<br>A) repeatedly
Q44: The worst case complexity function f(n)of an
Q45: The following implementation of QuickSort<br>Static void doQuickSort(int
Q46: Sequential Search is in the complexity class<br>A)