ONE CLASS OF ELEMENT SELECTION ALGORITHMS FROM A FINITE SET,
Abstract
Let a table be given which is filled with sets of symbols of some alphabet. (For example, a dictionary or a table of the values of functions.) The problem arises to find a point in the given table on which the given set is written. The problem of looking for a word in the dictionary and the problem of finding the values of a function set by the table according to a given value of the argument, etc., are reduced to this problem. A trivial solution to this problem exists: it is possible to scan all sets of the table in succession and compare them with the given set until coincidence occurs. Such an algorithm is not very productive, especially in frequent selections. In the latter case it is possible to show a more rational method of inquiry based on a preliminary study of the given table. In the present report one class of algorithms of selection from the table is shown by an algorithm close to optimal among the algorithms of a given class.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 27, 1967
- Accession Number
- AD0675423
Entities
People
- Yu. I. Zhuravlev
Organizations
- National Air and Space Intelligence Center