what is efficient linear search algorithm on an ordered integer array?

35 Views Asked by At

what is efficient linear search algorithm on an ordered integer array? and what is the average-case time complexity A(n) when assume that all 2n+1 events(why?) are equally probable?

1

There are 1 best solutions below

0
On

The standard search algorithm on an ordered array Is the binary search which has logarithmic time.

I'm not sure what you mean by a linear search algorithm.

I seem to recall reading many years ago that if you do an interpolatory binary search that the average time will be log log n.