Scribd
Upload
3 views1 page

Binary Search

Binary Search is an efficient algorithm that divides a sorted array into two halves to find a target value. It is faster than linear search and works only on unique, sorted arrays. The process involves calculating the mid-point and adjusting the search bounds until the value is found or determined to be absent.

Uploaded by

greenfieldworldschool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views1 page

Binary Search

Binary Search is an efficient algorithm that divides a sorted array into two halves to find a target value. It is faster than linear search and works only on unique, sorted arrays. The process involves calculating the mid-point and adjusting the search bounds until the value is found or determined to be absent.

Uploaded by

greenfieldworldschool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

BINARY SEARCH

In Binary Search, the array is divided into two equal halves. The search value is then checked whether the value in the mid
element of the array is the search value or not. If not, then it is checked whether the search value is on the lower end or the
upper end of the array. The array is continuously divided till the number is found or not.

CHARACTERISTICS OF BINARY SEARCH

 Binary Search takes place by dividing the array into two equal halves till the number is found or not
 It is a faster process than linear search
 It is suitable when the volume of data is large
 It can be performed on an arranged or a sorted array only.
 It can be performed on a unique array only (no duplicate elements).

To divide the array into two halves, we have to make the two ends of the array meet.

The lower end is known as the lower bound (lb) of the array which is always 0 unless otherwise specified.

The upper end is known as the upper bound (ub) of the array which is always n-1, where n is the number of elements in the
array. So if there are 50 elements, then the upper bound will be (50-1),that is 49.

Once we know the lower bound (lb) and the upper bound (ub), we have to find the middle or mid bound using the formula:

mb = (lb + ub)/2

Supposing there is an array such as:

0 1 2 3 4 5 6 7 8 9

3 5 7 11 13 15 21 24 31 36

Let us find 31 in the above array

Step 1

lb=0,ub=9
mb =(lb+ub)/2
=(0+9)/2
=4
So the element in the mid bound is 4 (a[4]=13)
Now let us check whether the number in the mid element is equal to the search vallue or not
That means the value in the mid bound is not the search value
Now let us check whether the search value is on the lower half or upper half
if(a[mb], that is 13<31) (true)
lb=mb+1
Since 31 is on the upper half, we know that there is no need in searching of the value in the lower half
So we reduce the array now from index 5 to 9
5 6 7 8 9

15 21 24 31 36

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy