Question

The average time required to perform a successful sequential search for an element in an array a(1 : n) is given by

Answer 1

At the point when information things are put away in a gathering, for example, a rundown, we say that they have a direct or consecutive relationship.

Every datum thing is put away in a position with respect to the others.

In Python records, these relative positions are the list estimations of the individual things. This procedure offers ascend to our first looking system, the consecutive hunt.