implement the three algorithms presented in the first class on slide 18 of the file Wk1_Ch04_the_efficiency_of_algorithms.pptx as 3 methods:

methodA, methodB, methodC

There you have the algorithm A, B and C. You will run the three implementations of the algorithms with imputs and do the computation but it does not need to print to the screen the actual sum (for the last value it could exceed the maximum value stored into a long); it should print on the screen the time taken for the running of the algorithm :

1,000,000

1,000,000,000

1,000,000,000,000,000,000

To print the time you should use something like

long startTime = System.currentTimeMillis(); methodA(1000000); long endTime = System.currentTimeMillis(); System.out.println("That method A for 1,000,000 took " + (endTime - startTime) + " milliseconds");

Your submission for part a should be the java file/files for solving the problem, an actual list of the running times for all the 3*3 possibilities (3 algorithm*3 imputs each)