Consider the following two loops:
// Loop Afor (i = 1; i <= n; i++)for (j = 1; j <= 10000; j++)sum = sum + j;// Loop Bfor (i = 1; i <= n; i++)for (j = 1; j <= n; j++)sum = sum + j;
Although Loop A is O(n) and Loop B is O(n2), Loop B can be faster than Loop A for small values of n. Design and implement an experiment to find a value of n for which Loop B is faster.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.