Register
Filter

Recent activity by shafinaz

0 answers
1
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)