In Java

Implement and test running time for consecutive integer checking vs Euclid's method.

1Implement the naive method and Horner's method to compute the value of a polynomial and test your code to ensure it's working

2Experimentally, estimate the running time for each of the methods. Note that you will need to experiment with different values of n. You can use arrays to store values of the coefficients (not zero) and then pick a value for x that is not zero. Create a spreadsheet and graph your results

You can use the attached file which contains a list of Fibonacci numbers to compute running times. Testing consecutive values will yield the most time since they are relatively prime.

List

89

144

233

377

610

987

1597

2584

4181

6765

10946

17711

28657

46368

75025

121393

196418

317811

514229

832040

1346269

2178309

3524578

5702887

9227465

14930352

24157817

39088169

63245986

102334155

165580141

267914296

433494437

701408733

1134903170

1836311903

2971215073

4807526976

7778742049

12586269025

20365011074

32951280099