原书出处
Introduction to Algorithms, Fourth Edition
16 第16章 摊还分析
es this strategy is bounded above by a constant. Problems 16-1 Binary reflected Gray code
A binary Gray code represents a sequence of nonnegative integers in binary such that to go from one integer to the next, exactly one bit flips every time.
The binary reflected Gray code represents a sequence of the integers 0 to 2k − 1 for some
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea