Binary search

ruby-talk
1

Hi, I am having problem converting the following algorithm (shown below)
into ruby code.

:find j such that B[j] <= A[length/2] B[j+1] using binary search

Can anyone help me please,

Thanks,
Tim

···

Broadband? Dial-up? Get reliable MSN Internet Access.
http://resourcecenter.msn.com/access/plans/default.asp

2

Hi, I am having problem converting the following algorithm (shown below)
into ruby code.

:find j such that B[j] <= A[length/2] B[j+1] using binary search

Can anyone help me please,

Thanks,
Tim

I ususally turn out to be wrong in these matters, but my answer is: “only if
you explain the algorithm better”.

Gavin

···

From: “martin tran” gokuzboy@hotmail.com

3

Check the following web page:

Alan Walkington

“martin tran” gokuzboy@hotmail.com wrote in message
news:F50XzQt1aP5N1lf8e460001a43d@hotmail.com…

···

Hi, I am having problem converting the following algorithm (shown below)
into ruby code.

:find j such that B[j] <= A[length/2] B[j+1] using binary search

Can anyone help me please,

Thanks,
Tim

Broadband? Dial-up? Get reliable MSN Internet Access.
http://resourcecenter.msn.com/access/plans/default.asp