In both the iterative and the recursive binary search, explain why the condition for halting the routine with the variable found assigned false is first > last.
What will be an ideal response?
The recursive calls are always made with a subarray starting at first and running to mid-1, or starting at mid+1 and running to last. When the array is reduced to one element, and you send that to a recursive call, the next call will either find that array element is the key or it will have first > last.
You might also like to view...
HyperTransport is
A) A method of connecting multiple Intel CPUs together B) The technology used with PCI-E transfers C) An AMD-designed high-speed bus D) A technology that enables PCI-X cards to work on the PCI-E bus
Which of the following terms are used to describe defining a class so that the implementation of the member functions is either not known or at least is irrelevant to its use
a. walling up b. encapsulation c. abstraction d. Caging up the data and functions e. Information hiding