1 votes 1 votes 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) Algorithms bad-question + – A_i_$_h asked Jul 24, 2017 A_i_$_h 390 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply joshi_nitish commented Jul 24, 2017 reply Follow Share d) O(n) ?? 0 votes 0 votes A_i_$_h commented Jul 24, 2017 reply Follow Share yes.............how? 0 votes 0 votes Rupendra Choudhary commented Nov 13, 2017 reply Follow Share why this question is being marked wrong ? 0 votes 0 votes shafinaz commented Jul 7, 2018 reply Follow Share how is this question solved ? 0 votes 0 votes Please log in or register to add a comment.
