-
Notifications
You must be signed in to change notification settings - Fork 20k
Adding Order Agnostic Binary Search #3790
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
Comments
Hey, I have created a pull request for this idea along with the code. |
Which PR is that? |
!assign |
Is this issue open? If so, can I work on it? |
It's done |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
What would you like to Propose?
Order Agnostic Binary Search Algorithm on 1-D Arrays.
Issue details
Order Agnostic Binary Search algorithm is used when we do not know whether the given array is descending or ascending.
Example: [5,4,3,2,1]
I can write clean code to find out whether the array is ascending or descending and apply Binary Search on it.
Please assign this to me as I have worked on this problem before.
Additional Information
No response
The text was updated successfully, but these errors were encountered: