Search Algorithm

Assumption is like this

• We know the length of the array

• Access time for $i$th element comparable value is $\Theta(1)$

• The swap time is $\Theta(1)$