INT Seqsearch (int Arr [], int Len, int target)
{
??? INT i = 0;
??? While ((i! = len) && (arr [i]! = target))
??? {
??????? i ;
???}
??? IF (i
??? {
??????? RETURN I;
???}
??? ELSE
??? {
??????? Return -1;
???}
}
INT BINSEARCH (int Arr [], int LEN, int target) {??? int low = 0; ??? Int high = len-1; ??? while (low <= high) ??? {??? ???? Int mid = (low high) / 2; ??????? f (arr [mid] == Target) ???????????????????????? RETURN MID; ???????} ??????? Else IF (Arr [MID]> TARGET) ??????? {??????????? HIGH = MID - 1; ???????} ??????? ELSE ??????? {??????????? Low = MID 1; ????? ??} ???} ??? Return -1;}
