#include<stdio.h>
int linearSearch(int arr[], int size, int element){
for (int i = 0; i < size; i++)
{
if(arr[i]==element){
return i;
}
}
return -1;
}
int binarySearch(int arr[], int size, int element){
int low, mid, high;
low = 0;
high = size-1;
while(low<=high){
mid = (low + high)/2;
if(arr[mid] == element){
return mid;
}
if(arr[mid]<element){
low = mid+1;
}
else{
high = mid -1;
}
}
return -1;
}
int main(){
int arr[] = {1,3,5,56,64,73,123,225,444};
int size = sizeof(arr)/sizeof(int);
int element = 444;
int searchIndex = binarySearch(arr, size, element);
printf("The element %d was found at index %d \n", element
, searchIndex
); return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KIAppbnQgbGluZWFyU2VhcmNoKGludCBhcnJbXSwgaW50IHNpemUsIGludCBlbGVtZW50KXsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgc2l6ZTsgaSsrKQogICAgewogICAgICAgIGlmKGFycltpXT09ZWxlbWVudCl7CiAgICAgICAgICAgIHJldHVybiBpOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiAtMTsKfQogCmludCBiaW5hcnlTZWFyY2goaW50IGFycltdLCBpbnQgc2l6ZSwgaW50IGVsZW1lbnQpewogICAgaW50IGxvdywgbWlkLCBoaWdoOwogICAgbG93ID0gMDsKICAgIGhpZ2ggPSBzaXplLTE7CiAgICAKICAgIHdoaWxlKGxvdzw9aGlnaCl7CiAgICAgICAgbWlkID0gKGxvdyArIGhpZ2gpLzI7CiAgICAgICAgaWYoYXJyW21pZF0gPT0gZWxlbWVudCl7CiAgICAgICAgICAgIHJldHVybiBtaWQ7CiAgICAgICAgfQogICAgICAgIGlmKGFyclttaWRdPGVsZW1lbnQpewogICAgICAgICAgICBsb3cgPSBtaWQrMTsKICAgICAgICB9CiAgICAgICAgZWxzZXsKICAgICAgICAgICAgaGlnaCA9IG1pZCAtMTsKICAgICAgICB9CiAgICB9IAogICAgcmV0dXJuIC0xOwogICAgCn0KIAppbnQgbWFpbigpewogICAKIAogICAgCiAgICBpbnQgYXJyW10gPSB7MSwzLDUsNTYsNjQsNzMsMTIzLDIyNSw0NDR9OwogICAgaW50IHNpemUgPSBzaXplb2YoYXJyKS9zaXplb2YoaW50KTsKICAgIGludCBlbGVtZW50ID0gNDQ0OwogICAgaW50IHNlYXJjaEluZGV4ID0gYmluYXJ5U2VhcmNoKGFyciwgc2l6ZSwgZWxlbWVudCk7CiAgICBwcmludGYoIlRoZSBlbGVtZW50ICVkIHdhcyBmb3VuZCBhdCBpbmRleCAlZCBcbiIsIGVsZW1lbnQsIHNlYXJjaEluZGV4KTsKICAgIHJldHVybiAwOwp9Cg==