dichotomizing search

dichotomizing search

[dī′käd·ə‚mīz·iŋ ‚sərch]
(computer science)
A procedure for searching an item in a set, in which, at each step, the set is divided into two parts, one part being then discarded if it can be logically shown that the item could not be in that part.