原书出处
Introduction to Algorithms, Fourth Edition
2 第2章 算法入门
P(x), given the coefficients a0, a1, a2, … , an in an array A[0 : n] and the value of x.
HORNER(A, n, x) 1 p = 0 2 for i = n downto 0 3 p = A[i] + x · p 4 return p
a. In terms of Θ-notation, what is the running time of this procedure? b. Write pseudocod
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea