Binary Search

Binary Search

Step1: Start

Step2: Initialize [BEG, END, ITEM, LOC, DATA]

Step3: BEG=LB

             END=UB

             MID= int ((BEG+END)/2) set

Step4: if BEG≤END And

            DATA[MID]≠ITEM then 5& 6 Looping

Step5: if ITEM< DATA [MID] then

          END=MID-1 set

          Else:

          BEG=MID+1 set

Step6: MID= int ((BEG+END)/2) set

Step7: DATA[MID]=ITEM then

                   LOC=MID set

                   Else:
                   LOC=Null set

Step8: Algorithm End