7) Time Complexity of a loop if the loop variables is reduced / increased by a...

 

Transcribed Image Text:

7) Time Complexity of a loop if the loop variables is reduced / increased by a sqrt amount as follows: Fun(int array A of size n) { for (int i = n; i>2; i = sqrt(i)) {//here sqrt means square root int a = i; } } Exact= Asymptotic = 7) Time Complexity of a loop if the loop variables is reduced / increased by a sqrt amount as follows: Fun(int array A of size n) { for (int i = n; i>2; i = sqrt(i)) {//here sqrt means square root int a = i; } } Exact= Asymptotic =

Answer rating: 100% (QA)

In the given code snippet we see a function named Fun that receives an array A of size n There is a for loop that iterates starting with i n and then ... View the full answer