Average Time Complexity of Searching An Array
It sounds like you're talking about a linear search.  If we assume that the key is equally likely to be in any of the $n$ locations in the array, then the expected location is $\frac{n+1}{2}$.  A linear search for this element would then require $O(\frac{n+1}{2}) = O(n)$ time.