BINARY SEARCHING IN JAVA in Hindi Lecture 109

//SEARCHING IN JAVA Searching----Searching means to find data in a file or records. There are two types of searching----- 1.Linear Searching 2.Binary Searching BINARY SEARCHING Binary Searching is applied on sorted array.We enter array elements and search elements. Step1--- beg=0,end=n-1 Step2----mid=(beg+end)/2 Step3----if(search element is greater than a[mid]) Then search in right side and Beg=mid+1 and end remain same Step4---if(search element is less than a[mid]) Then search in left side and End=mid-1 and beg remain same Step5-----if(search==a[mid]) Then element found and then we take break and come out of loop Step6—if(beg is greater thanend) Then element is not found Example---- Array elements a[i]=10,20,25,35,40,50 Search=25 Step1----- Beg=0 End=n-1=6-1=5 Mid=(beg+end)/2=(0+6)/2=3 A[mid]=35 Search=25 Step2--- Search is less than a[mid] then search in left side End=mid-1=3-1=2 Beg remain same beg=0 Mid=(0+2)/2=1 A[mid]=20 Search=25 Step3--- Search element is greater than a[mid] then search in right side Beg=mid+1=1+1=2 and end remain same Mid=(beg+end)/2=(2+2)/2=4/2=2 A[mid]=25 Search=25 Element found