Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Added the algorithm and test for Fibonacci Search#753

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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Merged
yanglbme merged 2 commits intoTheAlgorithms:Developmentfromabhijay94:Development
May 13, 2019

Conversation

abhijay94
Copy link
Contributor

Fibonacci search 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.

Copy link
Member

@yanglbmeyanglbme left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others.Learn more.

@abhijay94 Thanks for your contribution. Merged!

@yanglbmeyanglbme merged commite2a6b02 intoTheAlgorithms:DevelopmentMay 13, 2019
Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment
Reviewers

@yanglbmeyanglbmeyanglbme approved these changes

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

2 participants
@abhijay94@yanglbme

[8]ページ先頭

©2009-2025 Movatter.jp