Levels Tought:
Elementary,Middle School,High School,College,University,PHD
Teaching Since: | Jul 2017 |
Last Sign in: | 211 Weeks Ago, 1 Day Ago |
Questions Answered: | 15833 |
Tutorials Posted: | 15827 |
MBA,PHD, Juris Doctor
Strayer,Devery,Harvard University
Mar-1995 - Mar-2002
Manager Planning
WalMart
Mar-2001 - Feb-2009
I appreciate any help with the following Java code problem:
Â
Consider the following two loops:
Â
// Loop A
for (i=1; i < = n; i++)
               for (j=1; j < = 10000; j++)
               sum = sum + j;
//Loop B
for (i=1; i < = n; i++)
              for (j = 1; j <= n; j++)
               for (k = 1; k <=n; k++)
               sum = sum + K
Â
Â
-Find a value of "n" for which Loop B is faster, rewrite the code with the new "n" value making loop B faster.
-For which value(s) of n was Loop B faster?
-Are there any conclusions we can make from this exercise? What have you observed in running this experiment?
----------- Â ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly