Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create Binary Search 2111200001077.cpp #750

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 34 additions & 0 deletions Beginner/Binary Search 2111200001077.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
#include <iostream>
using namespace std;
int binarySearch(int arr[], int l, int r, int x)
{
while(l <=r) {
int mid = (l + r) / 2;
if (arr[mid] == x)
return mid;

else if (arr[mid] > x)
l=mid+1;
else
r=mid-1;
}
return -1;
}

int main()
{
int n,x;
cout<<"Enter soze of array followed by the elements of array";
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
cout<<"Enter Element to be searched";
cin>>x;
int result = binarySearch(arr, 0, n-1, x);
(result == -1) ? cout<<"\nElement is not present in array"
: cout<<"\nElement is present at index "<<result;
return 0;
}