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

Commit 20859ff

Browse files
DOCS Updated implemented algorithms section
1 parent 2ac6f2e commit 20859ff

File tree

1 file changed

+1
-0
lines changed

1 file changed

+1
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -11,6 +11,7 @@
1111
7. lg()
1212
8. Fibonacci.fib()
1313
9. Fibonacci.fast_fib()
14+
10. fact()
1415

1516
## Code Examples
1617
One interesting implementation is this algorithm to compute fibonacci sequences (exercise 1.1.19). It runs in O(1) time provided that the cache contains the previous two sequences. Generating the previous sequences is usually done using loops.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /