Correct But Too Loose

A pull request description says: "binarySearch runs in $O(n)$." A reviewer replies: "That is wrong, it is $O(\log n)$." Who is right?