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.
Posting Yuval Filmus's comment as an answer since they didn't:


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