tag:blogger.com,1999:blog-8712770457197348465.post3021648259792210421..comments2024-03-29T05:54:46.190-07:00Comments on Javarevisited: Recursive Binary Search Algorithm in Java - Example Tutorialjavin paulhttp://www.blogger.com/profile/15028902221295732276noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-8712770457197348465.post-163870707664647832022-09-23T09:32:20.577-07:002022-09-23T09:32:20.577-07:00Really help fullReally help fullAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-8712770457197348465.post-42826358235387666772017-06-22T06:04:43.570-07:002017-06-22T06:04:43.570-07:00Hello @Anonymous, good thought, but can you elabor...Hello @Anonymous, good thought, but can you elaborate more please?javin paulhttps://www.blogger.com/profile/15028902221295732276noreply@blogger.comtag:blogger.com,1999:blog-8712770457197348465.post-82598279930862814372017-06-22T04:00:32.602-07:002017-06-22T04:00:32.602-07:00Hello,
I venture to guess instead of the following...Hello,<br />I venture to guess instead of the following:<br />int mid = (low + high) / 2;<br />it's better to use something like<br />int mid = low + (high - low) / 2;<br />(or even better: low + (high - low) >> 1)<br />in order to prevent all the mess in case of an arrays having 2^32 elements.Anonymousnoreply@blogger.com