Re: Binary search with timestamps

In article <qq0a85-q99.ln1@[EMAIL PROTECTED]
>,
 Luc The Perverse <ataylor_no_spa_am@[EMAIL PROTECTED]
> wrote:

> I suggest calling your variables top and bottom.
> 
> And there are 3 cases, not two.  One is your pivot point is less than 
> the target, your pivot point is greater than the target or your pivot 
> point equals the target.  You exit if top<bottom.

To clarify, what he's suggesting is this:

(NOTE: logic completely done in newsreader, no syntax or correctness 
checking done.  But this should be easy to debug.)

top = array.length
bottom = 0
foundIndex = -1
while (top > bottom)
{
   mid = (top + bottom) / 2
   if array [mid] == desiredValue
      foundIndex = mid
      break
   else if array [mid] > desiredValue
      top = mid
   else
      bottom = mid
}

return (foundIndex)

-- 
Please take off your pants or I won't read your e-mail.
I will not, no matter how "good" the deal, patronise any business which
sends
unsolicited commercial e-mail or that advertises in discussion newsgroups.