[go: up one dir, main page]
Scribd
Upload
167 views4 pages

Unit 4 Binary Search

Binary search is an efficient algorithm for finding an element in a sorted array. It works by repeatedly dividing the search interval in half and eliminating half of the elements from consideration. This reduces the time complexity from O(n) for linear search to O(log n) for binary search. The algorithm compares the target element to the middle element of the array. If they match it returns the index, otherwise it recursively searches either the left or right half depending on if the target is less than or greater than the middle element.

Uploaded by

AashishBatchali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
167 views4 pages

Unit 4 Binary Search

Binary search is an efficient algorithm for finding an element in a sorted array. It works by repeatedly dividing the search interval in half and eliminating half of the elements from consideration. This reduces the time complexity from O(n) for linear search to O(log n) for binary search. The algorithm compares the target element to the middle element of the array. If they match it returns the index, otherwise it recursively searches either the left or right half depending on if the target is less than or greater than the middle element.

Uploaded by

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

Binary search

Given a sorted array arr[] of n elements, write a function to search a given element x in arr[].
A simple approach is to do linear search.The time complexity of above algorithm is O(n). Another
approach to perform the same task is using Binary Search.
Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with
an interval covering the whole array. If the value of the search key is less than the item in the
middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half.
Repeatedly check until the value is found or the interval is empty.
Example:

Image Source : http://www.nyckidd.com/bob/Linear%20Search%20and%20Binary


%20Search_WorkingCopy.pdf
The idea of binary search is to use the information that the array is sorted and reduce the time
complexity to O(Logn).

Recommended: Please solve it on “PRACTICE ” first, before


moving on to the solution.
We basically ignore half of the elements just after one comparison.
1. Compare x with the middle element.
2. If x matches with middle element, we return the mid index.
3. Else If x is greater than the mid element, then x can only lie in right half subarray after the
mid element. So we recur for right half.
4. Else (x is smaller) recur for the left half.
Recursive implementation of Binary Search
#include <stdio.h>

// A recursive binary search function. It returns location of x in


// given array arr[l..r] is present, otherwise -1
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l)
{
int mid = l + (r - l)/2;

// If the element is present at the middle itself


if (arr[mid] == x) return mid;

// If element is smaller than mid, then it can only be


present
// in left subarray
if (arr[mid] > x) return binarySearch(arr, l, mid-1, x);

// Else the element can only be present in right subarray


return binarySearch(arr, mid+1, r, x);
}

// We reach here when element is not present in array


return -1;
}

int main(void)
{
int arr[] = {2, 3, 4, 10, 40};
int n = sizeof(arr)/ sizeof(arr[0]);
int x = 10;
int result = binarySearch(arr, 0, n-1, x);
(result == -1)? printf("Element is not present in array")
: printf("Element is present at index %d",
result);
return 0;
}

Output:
Element is present at index 3

Iterative implementation of Binary Search

#include <stdio.h>

// A iterative binary search function. It returns location of x in


// given array arr[l..r] if present, otherwise -1
int binarySearch(int arr[], int l, int r, int x)
{
while (l <= r)
{
int m = l + (r-l)/2;

// Check if x is present at mid


if (arr[m] == x)
return m;

// If x greater, ignore left half


if (arr[m] < x)
l = m + 1;

// If x is smaller, ignore right half


else
r = m - 1;
}

// if we reach here, then element was not present


return -1;
}

int main(void)
{
int arr[] = {2, 3, 4, 10, 40};
int n = sizeof(arr)/ sizeof(arr[0]);
int x = 10;
int result = binarySearch(arr, 0, n-1, x);
(result == -1)? printf("Element is not present in array")
: printf("Element is present at index %d",
result);
return 0;
}

Output:
Element is present at index 3

Time Complexity:
The time complexity of Binary Search can be written as
T(n) = T(n/2) + c

The above recurrence can be solved either using Recurrence T ree method or Master method. It falls
in case II of Master Method and solution of the recurrence is .
Auxiliary Space: O(1) in case of iterative implementation. In case of recursive implementation,
O(Logn) recursion call stack space.

You might also like