Skip to content

/ Java

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

Jump to bottom

Create FibonacciSearch.java #1869

Open
wants to merge 1 commit into
base: master
from
Open

Create FibonacciSearch.java #1869

wants to merge 1 commit into from

Conversation

@sreyansbohara01
Copy link

@sreyansbohara01 sreyansbohara01 commented Oct 19, 2020 •
edited

Fibonacci search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers. Compared to binary search where the sorted array is divided into two equal-sized parts, one of which is examined further, Fibonacci search divides the array into two parts that have sizes that are consecutive Fibonacci numbers.

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?

References

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Java files are placed inside an existing directory.
  • All filenames are in all uppercase characters with no spaces or dashes.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
  • If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.
@sreyansbohara01
Create FibonacciSearch.java
Verified
This commit was created on GitHub.com and signed with a verified signature using GitHub’s key.
GPG key ID: 4AEE18F83AFDEB23 Learn about signing commits
0232990 
Fibonacci search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers. Compared to binary search where the sorted array is divided into two equal-sized parts, one of which is examined further, Fibonacci search divides the array into two parts that have sizes that are consecutive Fibonacci numbers.
@sreyansbohara01
Copy link
Author

@sreyansbohara01 sreyansbohara01 commented Oct 19, 2020

Fibonacci Search is a comparison-based technique that uses Fibonacci numbers to search an element in a sorted array.
For more information you may refer to : https://en.wikipedia.org/wiki/Fibonacci_search_technique
@sreyansbohara01
Copy link
Author

@sreyansbohara01 sreyansbohara01 commented Oct 20, 2020

Can someone please review and suggest/merge the pull request.
@sreyans01
Copy link

@sreyans01 sreyans01 commented Oct 29, 2020

Can someone please review and suggest/merge the pull request.

If there's any problem merging the pull request, then do comment down below.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Linked issues

Successfully merging this pull request may close these issues.

None yet

2 participants
@sreyansbohara01 @sreyans01
You can’t perform that action at this time.