There are a variety of searching functions that are faster than a sequential search, but they ALL require that the list is in a known and consistent order. If even one item is out of order the results of a binary search will be unpredictable. In this case the ONLY choice is a simple sequential search.
The information on Computing.Net is the opinions of its users. Such
opinions may not be accurate and they are to be used at your own risk.
Computing.Net cannot verify the validity of the statements made on this
site. Computing.Net and Purch hereby disclaim all responsibility
and liability for the content of Computing.Net and its accuracy.