NIST

Bond Sequential Search

(algorithm)

Definition: Search an array or list for two keys at once by using the bitwise or of the keys as the search key. When a possible match is found, compare against each key against the item.

Generalization (I am a kind of ...)
search.

Aggregate child (... is a part of or used in me.)
linear search.

Note: Since one pass can find two keys, the amortized run time is about half that of linear search.

Author: PEB

More information

Omer H. Abu El Haija and Azmi Alazzam, Bond-Sequential Search (BSS), Proc. World Congress on Engineering and Computer Science (WCECS) 2012, Vol I, San Francisco, California, USA, October 2012. http://www.iaeng.org/publication/WCECS2012/WCECS2012_pp194-198.pdf accessed 9 June 2016.


Go to the
Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 9 June 2016.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "Bond Sequential Search", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 9 June 2016. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/BondSeqSearch.html