Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Algorithm A: Algorithm B: Algorithm C: long sum = 0; sum = 0; sum = n * (n + 1) / 2; for (long i

Algorithm A: Algorithm B: Algorithm C:

long sum = 0; sum = 0; sum = n * (n + 1) / 2;

for (long i = 1; i <= n; i++) for (long i = 1; i <= n; i++)

sum = sum + i; {

for (long j = 1; j <= i; j++)

sum = sum + 1;

} // end for

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

Professional SQL Server 2000 Database Design

Authors: Louis Davidson

1st Edition

1861004761, 978-1861004765

More Books

Students also viewed these Databases questions

Question

Explain the process of MBO

Answered: 1 week ago