lean-ja / lean-ja/lean-by-example
bitVect の使用例？フィボナッチ数列
Open
Nobody has claimed this yet.
要調査
- Dominant language
- Lean
- Stars
- 188
- Forks
- 15
- Avg merge
- 9h 8m
- Merged PRs (30d)
- 6
Description
フィボナッチ数列を高速で計算する方法として、bitVect を使用する方法があったような気がする
Erickson の「アルゴリズム」に載ってなかったっけ？
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No file, test, or entry point is named. First clarify whether the project should add a Lean example using bitVect for fast Fibonacci computation, and verify the reference to Erickson's “Algorithms.” Done would be a concrete, agreed example with its intended explanation and location identified.
Written by the indexing model from the issue text.
Assessment
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100