Scribd
Upload
70 views

Linear and Binary Search

This document contains code for two searching algorithms: binary search and linear search. The binary search code takes in an unsorted array of integers, the number of elements, and a search value. It uses a divide and conquer approach to recursively narrow down the search space and check if the target value is present. The linear search code simply iterates through each element of the array sequentially and checks if the target value matches. Both print out if the search value was found and its location.

Uploaded by

Sabitha Durai
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
70 views

Linear and Binary Search

This document contains code for two searching algorithms: binary search and linear search. The binary search code takes in an unsorted array of integers, the number of elements, and a search value. It uses a divide and conquer approach to recursively narrow down the search space and check if the target value is present. The linear search code simply iterates through each element of the array sequentially and checks if the target value matches. Both print out if the search value was found and its location.

Uploaded by

Sabitha Durai
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

// 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;

\\Linear search c program


#include <stdio.h>
int main()
{
int array[100], search, c, n;
printf("Enter the number of elements in array\n");
scanf("%d",&n);
printf("Enter %d integer(s)\n", n);
for (c = 0; c < n; c++)
scanf("%d", &array[c]);
printf("Enter the number to search\n");
scanf("%d", &search);
for (c = 0; c < n; c++)
{
if (array[c] == search)
/* if required element found */
{
printf("%d is present at location %d.\n", search, c+1);
break;
}
}
if (c == n)
printf("%d is not present in array.\n", search);
}

return 0;

You might also like