Question

What is the time complexity of the following function fun()? int fun(int n) { int count = 0; for (int i = 0; i < n; i++) for (int j = 2n; j > 0; j--) count = count + 1; return count; } Group of answer choices

Name: what is the time complexity of the following function fun int funint n int count 0 for int i 0 i n i for int j 2n j 0 j count count 1 return count group of answer choices 14533
Uploaded: 2023-10-10T05:21:17-08:00
Duration: 2 min 12 s
Channel: Madhur L
Description: what is the time complexity of the following function fun int funint n int count 0 for int i 0 i n i for int j 2n j 0 j count count 1 return count group of answer choices 14533

          What is the time complexity of the following function fun()?
int fun(int n)
{
  int count = 0;
  for (int i = 0; i < n; i++)
     for (int j = 2n; j > 0; j--)
       count = count + 1;
  return count;
}
Group of answer choices

Added by M-Nica B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Madhur L

10/10/2023

Step 1

The function `fun()` contains two nested loops: - The outer loop runs from `i = 0` to `i < n`. - The inner loop runs from `j = 2n` to `j > 0`. Show more…

Show all steps

Thanks for your feedback!

What is the time complexity of the following function fun()? int fun(int n) { int count = 0; for (int i = 0; i < n; i++) for (int j = 2n; j > 0; j--) count = count + 1; return count; } Group of answer choices