Question

Activity No. 2
Find the Big O notation of the following. Show solution.
1. int fun (int n)
{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}​

Answer 1

Answer:

I not understand your question sorry

Please follow me