alculate 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; }

C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter6: Modularity Using Functions
Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion
Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...
icon
Related questions
Question

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;

}

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fibonacci algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning