Answered

Get personalized answers to your unique questions on IDNLearn.com. Ask your questions and get detailed, reliable answers from our community of experienced experts.

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

We appreciate every question and answer you provide. Keep engaging and finding the best solutions. This community is the perfect place to learn and grow together. Your search for solutions ends here at IDNLearn.com. Thank you for visiting, and come back soon for more helpful information.