Register

Time Complexity

392 views
1 votes
1 votes
What will be the time complexity of the following algorithm ?

A(n){

if(n<=1)

    return 1;

for(i=1;i<n;i++){

   for(j=0;j<3;j++){

     A(n-1)

   }

 }

}
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
0 answers
1
Mk Utkarsh asked Jan 9, 2018
423 views
Time Complexity
T(n) $\leq$ T($\frac{n}{5}$) + T($\frac{7n}{10}$) + 15n T(n) $\leq$ 5 when n $<$ 6
T(n) $\leq$ T($\frac{n}{5}$) + T($\frac{7n}{10}$) + 15nT(n) $\leq$ 5 when n $<$ 6
User Avatar
5 votes
5 votes
2 answers
3
shaurya vardhan asked Nov 2, 2017
1,668 views
Time Complexity
Consider the following function Void func(int n){ Int k=n; Int i=0; for(;i<n;i++){ while(k>1){ k>>=1; } } What is the worst case time complexity of the function?
Consider the following functionVoid func(int n){Int k=n;Int i=0;for(;i<n;i++){while(k>1){k>>=1;}}What is the worst case time complexity of the function?
User Avatar
4 votes
4 votes
1 answer
4
shaurya vardhan asked Nov 2, 2017
658 views
Time Complexity
Consider the following code….. Search(int n){ if(n<2) then return; else{ s=0; for(i=1;i<=8;i++){ Search(n/2); } for(i=1;i<n*n;i++){ for(j=1;j<n;j=j*2){ s=s+i; } } } } Assume s is a global variable.Find the complexity of the given Search(n)?
Consider the following code…..Search(int n){if(n<2)then return; else{s=0;for(i=1;i<=8;i++){Search(n/2);}for(i=1;i<n*n;i++){for(j=1;j<n;j=j*2){s=s+i;}}}}Assume s is a gl...
User Avatar
Link Copied!