0% found this document useful (0 votes)
247 views2 pages

Flowchart of Sequential Search: Begin

Sequential search is a method that checks each element of a list one by one to see if it matches a target key. The search starts at the first element and increments the index i until either the key is found and matched or the end of the list is reached without a match, indicating the key is not in the list.

Uploaded by

Piyush Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
247 views2 pages

Flowchart of Sequential Search: Begin

Sequential search is a method that checks each element of a list one by one to see if it matches a target key. The search starts at the first element and increments the index i until either the key is found and matched or the end of the list is reached without a match, indicating the key is not in the list.

Uploaded by

Piyush Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

begin

Flowchart of sequential search

i=0

list[i]=key?

no

i=i+1

no

i==length?

yes

item not
found

end

yes

item found at
i

You might also like