1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
EXAMPLE OF BINARY SEARCH
Consider an array a consisting of items‐10, 20, 30, 40,50,60,70
10 20 30 40 50 60 70
Let in this sorted array we have to search item ’70’
Mid= (beg +end)/2= (1+7)/2= 4
Now,70>A [4] So, beg= 4+1 =5
And
End=7
Mid= (5+7)/2 = 6
Again
70>A [6]
Therefore, Beg=7,End=7
Now,
A[item] = A[mid]
i.e. 70=70
Hence we get the output, 70 is searched at location =A [7]
EXAMPLE:
To implement binary search we are provided with a sorted array A which consist
of following elements.
Sorted array A=3, 7, 11, 17, 19, 21, 27
Element to be searched is 7
X=7
Middle=1+7/2=4
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 157 ‐