原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
ID(Fk, Fk−1), or exactly k – 1 times, which meets the upper bound given by Theorem 31.11.
Since Fk is approximately , where ϕ is the golden ratio defined by equation (3.32) on page 69, the number of recursive calls in EUCLID is O(1g b). (See Exercise 31.2-5 for a tighter bound.) Therefore, a call of EUCLID on two β-bit numbers performs O(β) arithmetic operations and O(β3) bit operations (assuming that multiplication and division of β-bit numbers take
O(β2) bit operations). Problem 31-2 asks you to prove an O(β2) bound on the number of bit
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea