A Time-Optimal Multiple Search Algorithm
β
D. Bhagavathi; S. Olariu; W. Shen; L. Wilson
π
Article
π
1994
π
Elsevier Science
π
English
β 739 KB
Given a sorted sequence \(A=a_{1}, a_{2}, \ldots, a_{n}\) of items from a totally ordered universe, along with an arbitrary sequence \(Q=q_{1}\), \(q_{2}, \ldots, q_{m}(1 \leq m \leq n)\) of queries, the multiple search problem involves computing for every \(q_{j}(1 \leq j \leq m)\) the unique \(a_{