1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
This searching technique searches the given item in minimum possible no. of
comparisons. To do the binary search first we have to sort the given array
elements.
IMPEMENTATION OF BINARY SEARCH
Binary search operation is divided into 3 cases
Case1: if a [item] a [mid]
Then, big=mid+1
ALGORITHIM
The algorithm for binary search is given below‐
Algo: Binary search(A,N,X)
A=name of array
N=number of element
X=element to be searched in array A
If the search is successful this algorithm finds the location or position of x in
the array otherwise the value 0 is return.
1. [Initialize variables]
First=1, last=N
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 155 ‐