Skip to content
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.

Sign up for GitHub

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

Changing recursive logic to iterative for calculating fibonacci ratios in fibonacci search method #15

Open
ShudarsanRegmi opened this issue Aug 3, 2024 · 1 comment
Open

Changing recursive logic to iterative for calculating fibonacci ratios in fibonacci search method #15

ShudarsanRegmi opened this issue Aug 3, 2024 · 1 comment
Labels
good first issue Good for newcomers

Comments

@ShudarsanRegmi
Copy link
Owner

The current implementation of fibonacci search method uses recursive logic to calculate the fibonacci ratios f(n-k)/ f(n-k+1). We want the iterative logic instead. Please change the function which is doing that operation and change the logic to iterative.
@ShudarsanRegmi ShudarsanRegmi added the good first issue Good for newcomers label Aug 3, 2024
@jayendra541
Copy link

Kindly assign this issue to me! thank you

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

No branches or pull requests
2 participants
@ShudarsanRegmi @jayendra541