0 LIKES LikeUnLike
8. Consider the following two loops:// Loop Afor (i=1; i <=n; i++) for (j=1; j <= 1000; 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 experience to find a value of n for which Loop B is faster. Write down your coding.9. Repeat Question 8, but use the following for Loop B:// Loop Bfor (i=1; i <=n; i++) for (j=1; j <= n; j++) for (k=1; k <= n; k++) sum = sum + k;
Tags:
Report (0) (0) | earlier
Latest activity: earlier. This question has 1 answers.