c++ binary search
#include<bits/stdc++.h> using namespace std; int main(){ //lets do it int n; cin>>n; int arr[n]; for(int i=0;i<n;i++) cin>>arr[i]; int target; cin>>target; // target=? int l=0,h=n-1; int index=-1; while(l<=h) { int mid=(l+h)/2; if(arr[mid]==target){ index=mid; break; }else if(arr[mid]<target) l=mid+1; else h=mid-1; } cout<<"NUMBER FOUND AT INDEX-"<<index<<endl; return 0; }
binary search c++
int binarySearch(int arr[], int l, int r, int x) { if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); return binarySearch(arr, mid + 1, r, x); } return -1; }
Source: www.google.com
binary search c++
int binarySearch(vector<int> v,int x) { int l = 0, r = v.size() - 1, mid; while (l <= r) { mid = (l + r) / 2; if (v[mid] == x) return mid; else if (v[mid] > x) { r = mid - 1; } else if(v[mid] < x) { l = mid + 1; } } return -1; }