Commit 77d141f

authored

DOCS Updated implemented algorithms section

1 parent 36bab00 commit 77d141fCopy full SHA for 77d141f

File tree

-0

lines changed

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -12,6 +12,7 @@`
`12`	`12`	`8. Fibonacci.fib()`
`13`	`13`	`9. Fibonacci.fast_fib()`
`14`	`14`	`10. fact()`
	`15`	`+11. binary_search()`
`15`	`16`
`16`	`17`	`## Code Examples`
`17`	`18`	`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.`

Comments

(0)