A sequential algorithm is the simplest way to search for an item in a collection. It starts from the first item and compares it with the item you are looking for. If they match, the search is over.

The simplest and fastest algorithm is the sequential search due to Dykstra (1971), which starts with an empty design and adds successive candidate points so that the chosen criterion is optimized at ...