diff --git a/Searching/BinarySearch.cpp b/Searching/BinarySearch.cpp index 1593eecb..697c14ca 100644 --- a/Searching/BinarySearch.cpp +++ b/Searching/BinarySearch.cpp @@ -1,36 +1,40 @@ -#include +// CPP program to implement +// Binary Search in +// Standard Template Library (STL) +#include +#include + using namespace std; -//Create a predicate to return T/F for an ind -bool predicate(vector&v, int ind, int search_token){ - return v[ind] >= search_token; + +void show(int a[], int arraysize) +{ + for (int i = 0; i < arraysize; ++i) + cout << a[i] << ","; } -int binarySeach(vector&v, int search_token){ - int low = 0,high = v.size(),mid; - while(low&v, int search_token, int begin, int end){ - if(begin==end){ - if(v[begin]==search_token) - return begin; - return -1; - } - int mid = (begin+end)/2; - if(predicate(v,mid,search_token)){ - return recursiveBinarySearch(v,search_token,begin,mid); - } - return recursiveBinarySearch(v,search_token,mid+1,end); -} -int main(){ - vector v = {1,2,4,5,11,20,25}; - cout<