Scribd
Upload
33 views1 page

UNIT1 Programs

This C code implements a binary search algorithm to search for a target value within a sorted array of integers. The code first takes input of array size and elements, then the target value. It initializes first and last index pointers and calculates the middle index. In a while loop, it compares the middle element to the target and updates the first or last pointer, recalculating middle, until the target is found or the pointers cross.

Uploaded by

Thamarai Selvi Koselram
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
33 views1 page

UNIT1 Programs

This C code implements a binary search algorithm to search for a target value within a sorted array of integers. The code first takes input of array size and elements, then the target value. It initializes first and last index pointers and calculates the middle index. In a while loop, it compares the middle element to the target and updates the first or last pointer, recalculating middle, until the target is found or the pointers cross.

Uploaded by

Thamarai Selvi Koselram
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

C programming code for binary search

#include <stdio.h>
 
int main()
{
int c, first, last, middle, n, search, array[100];
 
printf("Enter number of elements\n");
scanf("%d",&n);
 
printf("Enter %d integers\n", n);
 
for (c = 0; c < n; c++)
scanf("%d",&array[c]);
 
printf("Enter value to find\n");
scanf("%d", &search);
 
first = 0;
last = n - 1;
middle = (first+last)/2;
 
while (first <= last) {
if (array[middle] < search)
first = middle + 1;
else if (array[middle] == search) {
printf("%d found at location %d.\n", search, middle+1);
break;
}
else
last = middle - 1;
 
middle = (first + last)/2;
}
if (first > last)
printf("Not found! %d is not present in the list.\n", search);
 
return 0;
}

You might also like