Skip to content

Fibonacci implementation (TODO) #25

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

Merged
merged 1 commit into from
Aug 15, 2017
Merged

Fibonacci implementation (TODO) #25

merged 1 commit into from
Aug 15, 2017

Conversation

dmytrostriletskyi
Copy link
Contributor

@dmytrostriletskyi dmytrostriletskyi commented Aug 14, 2017

Hello,

I tried to implement one of TODO points — Fibonacci.

For first step I did two ways of getting Fibonacci sequence — recursion and cache.
If my work seems good, I will add other solutions and extend information.

TODO for current stage of pull request:

  • Documentation
  • Fibonacci implementations
  • Tests

Fibonacci implementations:

  • Via golden ratio
  • Matrix
  • Using memoization
  • Using generators
  • Using looping technique

@OmkarPathak
Copy link
Owner

Really great effort. I am looking forward when you will be completing other implementations of fibonacci.

@OmkarPathak OmkarPathak merged commit e8d90a6 into OmkarPathak:master Aug 15, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants