Answer to question 2.1
Select the recurrence relation for the running time T ( n ) of the recursive function F (with the while loop and single recursive call) that matches your answer.
If you did not solve this subproblem, choose "I did not solve this subproblem".

Question

Answer to question 2.1 
 Select the recurrence relation for the running time  T ( n ) of the recursive function F (with the while loop and single recursive call) that matches your answer. 
 If you did not solve this subproblem, choose "I did not solve this subproblem".

Answer

T ( n ) =  T (⌊√ n ⌋) + Θ( n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

I did not solve this subproblem.

Answer

T ( n ) =  T (⌊√ n ⌋) + Θ(√ n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

T ( n ) =  T (⌊ n /2⌋) +  T (⌈ n /2⌉) + Θ(√ n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

T ( n ) =  T (⌊√ n ⌋) + Θ(log  n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

T ( n ) = 2 T ( n /2) + Θ(√ n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

No correct option.

Answer

T ( n ) = 2 T (⌊√ n ⌋) + Θ(√ n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

T ( n ) =  T (⌊√ n ⌋) + Θ(1) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

T ( n ) =  T ( n /2) + Θ(√ n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Answer

T ( n ) =  T ( n −1) + Θ(√ n ) for  n  > 1;  T ( n ) = Θ(1) for  n  ≤ 1

Crowdly

Answer to question 2.1 Select the recurrence relation for the running time T ...

Хочете миттєвий доступ до всіх перевірених відповідей на moodle.innopolis.university?