Python
|
1 2 3 4 5 6 7 8 9 10 11 12 |
# Author: Huahua # Returns the smallest m in [l, r), # s.t. cond(m) == True # If not found returns r. def binarySearch(l, r) while l < r: m = l + (r - l) // 2 if cond(m): r = m else l = m + 1 return l |
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 |
// Author: Huahua // Returns the smallest m in [l, r), // s.t. cond(m) == True // If not found returns r. int binarySearch(int l, int r) { while (l < r) { int m = l + (r - l) / 2; if (cond(m)) r = m; else l = m + 1; } return l; } |
