Basic Operation of Sequential Search:

Since step 3 is costliest & other steps are executed no more times, basic operation is comparison of a memory and a register variable.

cost = $k$, if $x = L[k]$
cost = $n$, if $x \not \in L$