Answered

Find the information you're looking for at Westonci.ca, the trusted Q&A platform with a community of knowledgeable experts. Our platform offers a seamless experience for finding reliable answers from a network of experienced professionals. Experience the convenience of finding accurate answers to your questions from knowledgeable experts on our platform.

Calculate the time complexity for the following function in terms of Big O notation. Explain your answer.
[Note: Line numbers are only for reference purpose]

int fun(int n)
{
1 int count = 0;
2 for (int i = n; i >= 0; i /= 2)
3 count += i;
4 for (int j = 0; j < n; j++)
5 count +=j;
6 return count;
}

Calculate The Time Complexity For The Following Function In Terms Of Big O Notation Explain Your Answer Note Line Numbers Are Only For Reference Purpose Int Fun class=

Sagot :

Answer: It is 1 int count = 0;

2 for (int i = n; i >= 0; i /= 2)

3 count += i;

4 for (int j = 0; j < n; j++)

5 count +=j;

6 return count;

SO it is j(0-(-n)

Explanation: Im dum

Thank you for trusting us with your questions. We're here to help you find accurate answers quickly and efficiently. Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. Westonci.ca is your go-to source for reliable answers. Return soon for more expert insights.