Thread: Re : binary search

Dear All,

Can anyone tell me at most how many comparisions needed to find an item in a list of size 200 using binary and sequential search.

For sequential search, it should be (n-1), right? i.e. if a list exist 200 items, it should be (200-1) = 199, but how about binary search, how to formulate this??? Please help.

Thanks and best regards
Kim

Hi Kim,
Since 2^8 = 256, 8 comparisons would be adequate for a list of up to 256 items.