Binary Searching

Binary search is an extremely efficient algorithm. This search technique searches the given item in minimum possible comparisons. To do the binary search first we had to sort the array elements. The logic behind this technique is given below:

1.      First find the middle element of the array.

2.      Compare the mid element with an item.

3.      There are three cases.

(a)    If it is desired element then search is successful.

(b)   If it is less than desired item then search only the first half of the array.

(c)    If it is greater than the desired element search in the second half of the array.

Repeat the same steps until an element are found or exhaust in the search area. In this algorithm every time we are reducing the search area. So number of comparisons keeps on decreasing. In worst case the number of comparison is atmost log (N+1). So it is an efficient algorithm when compared to linear search but the array has to be sorted before doing binary search.

Algorithm

            Here a is sorted array with lower bound LB and upper bound UB and item is a given item of information. The variables beg, end and mid denoted respectively the beginning end and middle location of a segment of element of a. this algorithm finds the location loc of item in a or set loc=NULL.

Data Structure & Algorithms Assignment Help, Live Experts

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.

ExpertsMind.com - Binary Searching Assignment Help, Binary Searching Homework Help, Binary Searching Assignment Tutors, Binary Searching Solutions, Binary Searching Answers, Searching and Hashing Assignment Tutors