+1 (218) 451-4151
glass
pen
clip
papers
heaphones

Let p(x) be a polynomial of degree n, that is, a. Describe a simple O(n 2 )-time algorithm for…

Let p(x) be a polynomial of degree n, that is, a. Describe a simple O(n 2 )-time algorithm for…

Let p(x) be a polynomial of degree n, that is, a. Describe a simple O(n2)-time algorithm for computing p(x).b. Describe an O(nlogn)-time algorithm for computing p(x), based upon a more efficient calculation of  xi.c. Now consider a rewriting of p(x) asWhich is known as Horner’s method. Using the big-Oh notation, characterize the number of arithmetic operations this method executes.