Ejemplo n.º 1
0
	bool binarySearch(const Accessor<int> &acc, int target) {
		size_t start = 0;
		size_t end = acc.size();
		while (start != end) {
			size_t m = start + (end-start)/2;
			if (acc[m] == target)
				return true;
			else if (acc[m] > target)
				end = m;
			else
				start = m+1;
		}
		return false;
	}