First Bad Version LeetCode solution in C++

1
class Solution {
2
 public:
3
  int firstBadVersion(int n) {
4
    // Using Binary Search
5
    int lo = 1, hi = n, mid;
6
    while (lo < hi) {
7
      mid = lo + (hi - lo) / 2;
8
      if (isBadVersion(mid))
9
        hi = mid;
10
      else
11
        lo = mid + 1;
12
    }
13
    return lo;
14
  }
15
};