Skip to content

Add the Exponential Search algorithm with explanation and examples #54

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

Closed
abhishektripathi66 opened this issue Nov 27, 2024 · 2 comments
Labels
good first issue Good for newcomers

Comments

@abhishektripathi66
Copy link
Owner

No description provided.

@abhishektripathi66 abhishektripathi66 added the good first issue Good for newcomers label Nov 27, 2024
Copy link

Stale issue message

@saurabh12nxf
Copy link
Contributor

Hello @abhishektripathi66 ,

I noticed the problem related to Exponential Search Algorithm and I would like to take it up. I understand searching algorithms well and I am sure I can do this efficiently.

This is a high-level summary of how I will do it:

  1. Create the Exponential Search Function: I will create a function "exponentialSearch" that locates the range in which the target element might be present and then carries out a binary search in that interval.
  2. Create the Binary Search Function: I will create a helper function "binarySearch" that conducts the search within the range found.
  3. "Test the Implementation:" I will build test sorted arrays and test the function to make sure it is working properly.

Let me know if I can be given this issue. I'm looking forward to contributing!

Thank you!

Best regards,
Saurabh Singh

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
good first issue Good for newcomers
Projects
None yet
Development

No branches or pull requests

2 participants