0 0 votes Algorithms + – Abhishek Barman 626 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply vashisht commented Dec 24, 2017 reply Follow flag is it O(n) 0 0 replyShare Abhishek Barman commented Dec 24, 2017 reply Follow flag YES,Can you explain? 0 0 replyShare Bad_Doctor commented Dec 24, 2017 reply Follow flag Greedy makes local optimal choice at each stage with the hope of getting a global optimal. So we will have to make choice at each of n stages. So I think minimum should be O(n). 0 0 replyShare Please log in or register to add a comment.
