# Determining a value in an algorithm on its first run

I was given the following algorithm as a solution to one of my problems. However, I am baffled at understanding how c' is ever initialized. The first if statement can never be reached, as c' is never set the first time. Can someone explain this to me? Am I just missing where c' gets set?

This is for Kleinberg and Tardos, Chapter 11, Question 12.

• It’s a typo - should be $c’=$ instead of $c’-$ in line 5. – Yuval Filmus Dec 11 '18 at 0:23
• Hey @YuvalFilmus, thanks. My professor sent this to me with NO explanation, just that my initial answer was wrong and this was right... Can you please post that as an answer so that I may accept it as a correct answer? – Jerry M. Dec 11 '18 at 0:25

It’s a typo - should be $$c’=$$ instead of $$c’-$$ in line 5.