Fibonacci numbers in the analysis of Euclid's GCD algorithm Hn in the analysis of FIND-MAX Stanford Lecture by Knuth "People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant math- ematical patterns that surround elegant computational pro- cedures. 4口￥0,43，t夏，里Q0 Hengfeng Wei (hfweiinju.cdu.cn2-2 The Efficiency of Algorithms March05,20205/43. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Fibonacci numbers in the analysis of Euclid’s gcd algorithm Hn in the analysis of find-max @ Stanford Lecture by Knuth “People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant math￾ematical patterns that surround elegant computational pro￾cedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically.” Hengfeng Wei (hfwei@nju.edu.cn) 2-2 The Efficiency of Algorithms March 05, 2020 5 / 43