This package provides a selection of searching algorithms. Well two actually, linear search and
binary chop search. Linear search can be applied to primitive arrays, any
Container<T>
or any sequence defined by two InputIterator<T>
. Binary
chop search is only relevant for random access containers, i.e. primitve arrays and
Array<T>
s or sequences define by two RandomAccessIterator<T>
since it
relies on computations with indexes and O(1) movement of iterators. There is little point in trying
to apply binary chop search to sequences where iterator movement by n places is O(n) as is the case
for the list types.