Question: What is the time complexity of the following recursive function? void f(int n){ if (n> 1){ System.out.println( Still going on...); f (n/ 2); f

 What is the time complexity of the following recursive function? void f(int  

What is the time complexity of the following recursive function? void f(int n){ if (n> 1){ System.out.println(" Still going on..."); f (n/ 2); f (n/ 2); Write your answer in O(.) notation. (log(n)) What is the time complexity of the following recursive function? int magic(int N){ sum = 0; for (i=0; i < N; i++) sum++; return magic(N-1) + sum;

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!