Question: Consider the following two loops: //Loop A for(i = 1; i
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 <= j; k++ ) sum = sum + k; What us the Big O of each loop? Design and implement an experiment to find a value of n for which Loop B is faster than Loop A.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
