Using the big-oh notation characterize the number of


(a) Describe a simple O(n2) time method for computing p(x).

(b) Now consider a rewriting of p(x) as

p(x) = a0+x(a1 +x(a2 +x(a3+···+x(an-1 +xan) ···))), which is known as Horner's method. Using the big-Oh notation, characterize the number of arithmetic operations this method executes.

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: Using the big-oh notation characterize the number of
Reference No:- TGS02253240

Now Priced at $10 (50% Discount)

Recommended (98%)

Rated (4.3/5)