Let *A* be an array of 31 numbers consisting of a sequence of 0's followed by a sequence of 1's. The Problem is to find the smallest index i such that *A[i]* is 1 by probing the minimum number of locations in *A*. The *worst case* number of probes performed by *an optimal* algorithm is _________

**Answer : **
5.0 to 5.0

XOqxrT http://pills2sale.com/ levitra nizagara

*Posted on 18/10/2020 15:03:34 by dobsonz*