← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.763Z

ty (odd or even) of a binary integer, and halving more quickly than computing remainders.

This problem investigates the binary gcd algorithm, which avoids the remainder computations used in Euclid’s algorithm. a. Prove that if a and b are both even, then gcd(a, b) = 2 · gcd(a/2, b/2). b. Prove that if a is odd and b is even, then gcd(a, b) = gcd(a, b/2). c. Prove that if a and b are both odd, then gcd(a, b) = gcd((a – b)/2, b). d. Design an efficient binary gcd

algorithm for input integers a and b, where a ≥ b, that runs in O(1g a) time. Assume that

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea