原书出处
Introduction to Algorithms, Fourth Edition
3 第3章 运行时间的刻画
h lg* n > 5. Fibonacci numbers We define the Fibonacci numbers Fi, for i ≥ 0, as follows:
Thus, after the first two, each Fibonacci number is the sum of the two previous ones, yielding the sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,
…. Fibonacci numbers are related to the golden ratio ϕ and its conjugate , which are the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea