tag:blogger.com,1999:blog-694855878384792308.post3245610329468706283..comments2024-03-21T06:26:49.387-07:00Comments on Java67: How Binary Search Algorithm Works? Java Example without Recursionjavin paulhttp://www.blogger.com/profile/15028902221295732276noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-694855878384792308.post-64967936535476247052024-02-28T05:08:20.735-08:002024-02-28T05:08:20.735-08:00Try this way
-------------------------------------...Try this way<br />-----------------------------------------------------------------------------------------------------<br /><br /><br /><br />import java.util.Scanner;<br /><br />public class BinarySearch {<br /> public static void main(String[] args) {<br /><br /> int a[] = { 1, 4, 5, 10, 45, 67, 89, 90, 95 };<br /> Scanner sc = new Scanner(System.in);<br /> System.out.println("Enter no for find..");<br /> int key = sc.nextInt();<br /><br /> boolean flag = false;<br /><br /> int l = 0;<br /> int h = a.length - 1;<br /><br /> while (l <= h) {<br /><br /> int m = (l + h) / 2;<br /><br /> if (a[m] == key) {<br /> System.out.println("Element Found");<br /> flag = true;<br /> break;<br /> }<br /> if (a[m] < key) {<br /> l = m + 1;<br /> }<br /> if (a[m] > key) {<br /> h = m - 1;<br /> }<br /> }<br /> if (flag == false) {<br /> System.out.println("Element not Found!!");<br /> }<br /><br /> }<br />}<br />Sanathttps://www.blogger.com/profile/12488924581267588541noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-18573533976846389092024-02-28T05:02:12.927-08:002024-02-28T05:02:12.927-08:00import java.util.Scanner;
public class BinarySear...<br />import java.util.Scanner;<br /><br />public class BinarySearch {<br /> public static void main(String[] args) {<br /><br /> int a[] = { 1, 4, 5, 10, 45, 67, 89, 90, 95 };<br /> Scanner sc = new Scanner(System.in);<br /> System.out.println("Enter no for find..");<br /> int key = sc.nextInt();<br /><br /> boolean flag = false;<br /><br /> int l = 0;<br /> int h = a.length - 1;<br /><br /> while (l <= h) {<br /><br /> int m = (l + h) / 2;<br /><br /> if (a[m] == key) {<br /> System.out.println("Element Found");<br /> flag = true;<br /> break;<br /> }<br /> if (a[m] < key) {<br /> l = m + 1;<br /> }<br /> if (a[m] > key) {<br /> h = m - 1;<br /> }<br /> }<br /> if (flag == false) {<br /> System.out.println("Element not Found!!");<br /> }<br /><br /> }<br />}<br />Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-69620316357239380072018-02-02T23:20:36.374-08:002018-02-02T23:20:36.374-08:0055
55<br />Anonymoushttps://www.blogger.com/profile/06105156257956196531noreply@blogger.com