Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Algorithm A: long sum = 0; for (long i = 1; i

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");

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

DB2 11 The Ultimate Database For Cloud Analytics And Mobile

Authors: John Campbell, Chris Crone, Gareth Jones, Surekha Parekh, Jay Yothers

1st Edition

ISBN: 1583474013, 978-1583474013

More Books

Students also viewed these Databases questions

Question

2. What are the different types of networks?

Answered: 1 week ago