Register

complexity

• retagged by
316 views

1 Answer

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

Related questions

0 votes
0 votes
3 answers
1
monty asked Dec 29, 2016
315 views
Time complexity
User Avatar
5 votes
5 votes
2 answers
2
Arjun asked Aug 29, 2014
2,509 views
What is the time complexity?
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } } The time complexity of the above code is?
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } }The time complexity of the ab...
User Avatar
10 votes
10 votes
3 answers
3
Satbir asked Jan 13, 2020
8,841 views
ISRO2020-36
What is the complexity of the following code? sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++; Which of the following is not a valid string? $O(n^2)$ $O(n\log\ n)$ $O(n)$ $O(n\log\ n\log\ n)$
What is the complexity of the following code?sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++;Which of the following is not a valid string?$O(n^2)$$O(n\log\ n)$$O(n)$$O(...
User Avatar
0 votes
0 votes
1 answer
4
Soumya Tiwari asked Oct 21, 2018
426 views
Made Easy Example 1.8
What is the total no of multiplications to be performed?? D=2 For i=1 to n do For j=i+1 to n do For k=j+1 to n do D=D×3
What is the total no of multiplications to be performed??D=2For i=1 to n do For j=i+1 to n do For k=j+1 to n do D=D×3
User Avatar
Link Copied!