title: What is the Best Complexity of a Greedy Algorithm?
body: <p>It seems like the best complexity would be linear O(n). </p>
  
  <p>Doesn't matter the case really, I'm speaking of greedy algorithms in general.</p>
  
  <p>Sometimes it pays off to be greedy?</p>
  
  <p>In the specific case that I am interested would be computing change.</p>
  
  <p>Say you need to give 35 cents in change. You have coins of 1, 5, 10, 25. The greedy algorithm, coded simply, would solve this problem quickly and easily. First grabbing 25 cents the highest value going in 35 and then next 10 cents to complete the total. This would be best case. Of course there are bad cases and cases where this greedy algorithm would have issues. I'm talking best case complexity for determining this type of problem.</p>