Consider a binary search algorithm as described in the modules.  Assume that the array to be searched is pre-sorted, so that sort is not part of the search algorithm.

Searching an array using a binary search (check all choices that apply):

	A.	... is usually faster for each search than a simple linear search.
	B.	... requires a pre-sorted array in order to work.
	C.	... is usually slower for each search than a simple linear search.
	D.	... requires more code and logic than a simple linear search.