Please send me the answer within 10 min!! i will rate you good for sure!! Please solve all 3 parts in Java with explanation!! Algorithm A: long sum = 0; for (long i = 1; i <= n; i++) sum = sum + i; Algorithm B: sum = 0; for (long i = 1; i <= n; i++) { for (long j = 1; j <= i; j++) sum = sum + 1; } // end for Algorithm C: sum = n * (n + 1) / 2; implement the above three algorithms: There you have the algorithm A, B and C. You will run the three implementations of the algorithms with inputs 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");
Please send me the answer within 10 min!! i will rate you good for sure!! Please solve all 3 parts in Java with explanation!!
long sum = 0;
for (long i = 1; i <= n; i++)
sum = sum + i;
Algorithm B:
sum = 0;
for (long i = 1; i <= n; i++)
{
for (long j = 1; j <= i; j++)
sum = sum + 1;
} // end for
Algorithm C:
sum = n * (n + 1) / 2;
implement the above three algorithms:
There you have the algorithm A, B and C. You will run the three implementations of the algorithms with inputs 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");
Step by step
Solved in 4 steps
