Article: Check if points belong to the convex polygon in O(log N)

okay so in the algorithm section it is mentioned quite a few times that we get the maximum i such that Pi is not counter-clockwise but in the code he what he is doing is getting the maximum i such that pi is counter-clockwise, so kindly fix it and if am wrong, i apologize and would like clarification