## Discussion Forum

Que. | 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________. |

a. | 2 |

b. | 3 |

c. | 4 |

d. | 5 |

Answer:5 |