Register

what is the time complexity of this code

• retagged by
1,037 views

1 Answer

1 1 vote
O(n^3)
Voting & Accepting an answer helps improve the community
← Previous · TM that accepts inpu...Next → · TM that rejects inpu...
← Previous in category · GraphNext in category → · ALGORITHMS
Position:
Show:

Related questions

0 0 votes
2 answers 2 answers
2.0k
2.0k views
radha gogia asked Jul 7, 2018
1,952 views
what is the time complexity of below code ?
foo(int n) { for(int i=0 ; i<n ;i++) for(int j=i ; j<=i*i ;j++) if(j%i==0) { for(int k=0;k<j;k++) printf("hii"); } } How to proceed here for analyzing the time complexity...
1 1 vote
2 2 answers
1.3k
1.3k views
Apeksha asked Aug 6, 2016
1,280 views
What is the time complexity of following code (4 level nested loop)?
for(i=1;i<=n;i++) for(j=1;j<=i;j++) for(k=1;k<=j;k++) for(l=1;l<=k;l++) printf("gate");
2 2 votes
3 answers 3 answers
1.9k
1.9k views
admin asked Oct 8, 2015
1,934 views
What is the time complexity of the following C code?
int Test(int n) { if (n<=0) return 0; else { int i = random(n-1); return Test(i) + Test(n-1-i); } }Suppose the function $\text{random}()$ takes constant time, then what ...
0 0 votes
1 answers 1 answer
795
795 views
gshivam63 asked May 21, 2016
795 views
What is the time complexity of this
find(int n) { if(x<2)return; else for(i =1; i<=4; i++) find (n/2); for(i= 1;i< =n*n; i++) sum=sum+1; }