Question

Describe the worst case running time (0 (T(n ))) of the
fallowing Pseudo code functions.
Algorithm I (A, v)
l Alength
for i I to L

if v=A[i]
then return i
return NIL
​

Answer 1

Answer:

I don't understand the question