binary search
#include <iostream>
using namespace std ;
//funtion to print the square of given number :
int square;
int fnding_square_number(int n){
square = n*n;
return square;
}
//function for binary search.
int binarysearching(int arr[], int size, int key){
int start = 0 ;
int end = size-1;
int mid = ( start + end )/2;
while (start<=end){
if( arr[mid]==key){
return mid;
}
//go to the right waka part:
if(key>arr[mid]){
start = mid+1;
}
else{
end = mid-1;
}
mid = (start + end)/2;
}
return -1;
}
int main(){
int arr[5]={12,13,14,15,16};
int answer = binarysearching(arr,5,11);
cout<<answer;
}
Comments
Post a Comment