Register

algorithm time complexity
closed

• closed by
218 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
dragonball asked Oct 15, 2017
583 views
Time complexity
User Avatar
1 votes
1 votes
0 answers
3
A_i_$_h asked Jul 24, 2017
391 views
algorithm
consider a problem defined on input of size n, if it is solved usuing greedy strategy then its time complexity is never less than a) O(n^2) b)O(n log n) c)O(logn) d) O(n)
consider a problem defined on input of size n, if it is solved usuing greedy strategy then its time complexity is never less thana) O(n^2)b)O(n log n)c)O(logn)d) O(n)
User Avatar
0 votes
0 votes
4 answers
4
iita asked Dec 31, 2016
592 views
complexity of function
User Avatar
Link Copied!