write Algorithm for Sequential search?

Question

What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?

Answer 1

Sequential is linear search only where we compare will each item present in array/list sequentially.[One after next order]

Algorithm :-

For each Item in [Array/List]
if [Item->value] == [Searching Value]
Stop the search