Scribd
Upload
45 views3 pages

Binary Search

The document provides two implementations of the binary search algorithm in C. The first implementation uses array indexing, while the second uses pointer arithmetic. Both versions search for a target element in a sorted array and return its index if found, or -1 if not found.

Uploaded by

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

Binary Search

The document provides two implementations of the binary search algorithm in C. The first implementation uses array indexing, while the second uses pointer arithmetic. Both versions search for a target element in a sorted array and return its index if found, or -1 if not found.

Uploaded by

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

Binary Search

#include <stdio.h>
int binarySearch(int arr[], int size, int target)
{
int left = 0;
int right = size - 1;

while (left <= right)


{
int mid = left + (right - left) / 2;

if (arr[mid] == target)
{
return mid; // Element found, return its index
}
else if (arr[mid] < target)
{
left = mid + 1; // Search the right half
}
else
{
right = mid - 1; // Search the left half
}
}

return -1; // Element not found


}

main()
{
int arr[] = {1, 3, 5, 7, 9, 11, 13, 15};
int size = sizeof(arr) / sizeof(arr[0]);
int target = 7;

int result = binarySearch(arr, size, target);


clrscr();
if (result != -1)
{
printf("Element %d found at index %d\n", target, result);
}
else
{
printf("Element %d not found in the array\n", target);
}

getch();
}

Binary Search using Two Pointers


#include <stdio.h>

int binarySearch(int arr[], int size, int target)


{
int *left = arr;
int *right = arr + size - 1; // Pointer to the last element

while (left <= right)


{
int *mid = left + (right - left) / 2;

if (*mid == target)
{
return mid - arr; // Element found, return its index
}
else if (*mid < target)
{
left = mid + 1; // Search the right half
}
else
{
right = mid - 1; // Search the left half
}
}

return -1; // Element not found


}

main()
{
int arr[] = {1, 3, 5, 7, 9, 11, 13, 15};
int size = sizeof(arr) / sizeof(arr[0]);
int target = 7;
int result = binarySearch(arr, size, target);
clrscr();
if (result != -1)
{
printf("Element %d found at index %d\n", target, result);
}
else
{
printf("Element %d not found in the array\n", target);
}

getch();
}

You might also like