Four, sequential search

Find by: Sequential Find and binary lookup (binary lookup), if the data is sorted, you can use binary find and order lookup, if the data is not sorted, use order lookup.

Sequential lookup speed is slow.

#include <iostream>using namespacestd;intSequentialsearch (intList[],Const intSizeConst intvalue);intMain () {intA[] = {9,3,4,5,7,8,0,1,2,3}; intRtn =sequentialsearch (A,Ten,3); cout<<"position subscript:"<< RTN <<Endl; System ("Pause"); return 0;}intSequentialsearch (intList[],Const intSizeConst intvalue) {    inti;  for(i =0; i < size; i++)    {        if(List[i] = =value)returni; }    if(i =size)return-1;}

The previous example can only find where the first occurrence occurs.

Four, sequential search