Randomized binary searching with tree structures
HA Clampett Jr - Communications of the ACM, 1964 - dl.acm.org
HA Clampett Jr
Communications of the ACM, 1964•dl.acm.orgRandomized binary searching with tree structures Page 1 there is reasonable hope of
proving that the iteration will always work. Timetables in Real Situations Even if the iteration
will always produce results for the problem described here, there are other difficulties which
have to be met before timetables can be constructed for the complex situations found in real
schools. The most difficult question, probably, is whether all of the restrictions can be stated
in the form of preassignments. Restrictions arise from a variety of sources: pattern-requirements …
proving that the iteration will always work. Timetables in Real Situations Even if the iteration
will always produce results for the problem described here, there are other difficulties which
have to be met before timetables can be constructed for the complex situations found in real
schools. The most difficult question, probably, is whether all of the restrictions can be stated
in the form of preassignments. Restrictions arise from a variety of sources: pattern-requirements …
A more efficient method of using tree structures is proposed, which utilizes both plus and minus branches in the search path. Very significant gains result when the search key includes alphabetic characters.
ACM Digital Library