#include <stdio.h>int main(){int i, low, high, mid, n, key, array[100];printf(“Enter number of elementsn”);scanf(“%d”,&n);printf(“Enter %d integersn”, n);for(i = 0; i < n; i++)scanf(“%d”,&array[i]);printf(“Enter value to findn”);scanf(“%d”, &key);low = 0;high = n – 1;mid = (low+high)/2;while (low <= high) {if(array[mid] < key)low = mid + 1;else if (array[mid] == key) {printf(“%d found at location %d.n”, key, mid+1);break;}elsehighContinue reading “Binary search”
Site Title 