3. Given the following code: a and b are integers n is the size of the...

Transcribed Image Text:

3. Given the following code: a and b are integers n is the size of the input basic_op is a basic operation myfun (a, b) { wowwww. } if (a == b) { for (x = = 1 to n+n) basic op; for (x 1 to n*n) = basic_op; } else { for (x = 1 to 10) for (y = 1 to x) basic_op; } a) What is the worst case running time, i.e., f(n)=O(?) Show your work/calculation for determining this? b) What is the best case running time, i.e., f(n) = 2 (?) Show your work/calculation for determining this? c) Can we describe the average case running time, i.e., f(n) = (?)? If yes, what is it? If no, explain why you can't. 3. Given the following code: a and b are integers n is the size of the input basic_op is a basic operation myfun (a, b) { wowwww. } if (a == b) { for (x = = 1 to n+n) basic op; for (x 1 to n*n) = basic_op; } else { for (x = 1 to 10) for (y = 1 to x) basic_op; } a) What is the worst case running time, i.e., f(n)=O(?) Show your work/calculation for determining this? b) What is the best case running time, i.e., f(n) = 2 (?) Show your work/calculation for determining this? c) Can we describe the average case running time, i.e., f(n) = (?)? If yes, what is it? If no, explain why you can't.

Answer rating: 100% (QA)

a To determine the worstcase running time we need to analyze the code segment that will take the lon... View the full answer