-
Notifications
You must be signed in to change notification settings - Fork 3.7k
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
Added Exponential_Search.cpp #6312
Open
visha09
wants to merge
1
commit into
OpenGenus:master
Choose a base branch
from
visha09:patch-1
base: master
Could not load branches
Branch not found: {{ refName }}
Could not load tags
Nothing to show
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,66 @@ | ||
// C++ program to find an element x in a | ||
// sorted array using Exponential search. | ||
#include <bits/stdc++.h> | ||
using namespace std; | ||
|
||
int binarySearch(int arr[], int, int, int); | ||
|
||
// Returns position of first occurrence of | ||
// x in array | ||
int exponentialSearch(int arr[], int n, int x) | ||
{ | ||
// If x is present at first location itself | ||
if (arr[0] == x) | ||
return 0; | ||
|
||
// Find range for binary search by | ||
// repeated doubling | ||
int i = 1; | ||
while (i < n && arr[i] <= x) | ||
i = i*2; | ||
|
||
// Call binary search for the found range. | ||
return binarySearch(arr, i/2, | ||
min(i, n-1), x); | ||
} | ||
|
||
// A recursive binary search function. It returns | ||
// location of x in given array arr[l..r] is | ||
// present, otherwise -1 | ||
int binarySearch(int arr[], int l, int r, int x) | ||
{ | ||
if (r >= l) | ||
{ | ||
int mid = l + (r - l)/2; | ||
|
||
// If the element is present at the middle | ||
// itself | ||
if (arr[mid] == x) | ||
return mid; | ||
|
||
// If element is smaller than mid, then it | ||
// can only be present n left subarray | ||
if (arr[mid] > x) | ||
return binarySearch(arr, l, mid-1, x); | ||
|
||
// Else the element can only be present | ||
// in right subarray | ||
return binarySearch(arr, mid+1, r, x); | ||
} | ||
|
||
// We reach here when element is not present | ||
// in array | ||
return -1; | ||
} | ||
|
||
// Driver code | ||
int main(void) | ||
{ | ||
int arr[] = {2, 3, 4, 10, 40}; | ||
int n = sizeof(arr)/ sizeof(arr[0]); | ||
int x = 10; | ||
int result = exponentialSearch(arr, n, x); | ||
(result == -1)? cout <<"Element is not present in array" | ||
: cout <<"Element is present at index " << result; | ||
return 0; | ||
} |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
why?