(i, li)
| 175 | |
| 176 | |
| 177 | def binary_search(i, li): |
| 178 | fn = lambda x: li[x] - x // i |
| 179 | x = -1 |
| 180 | b = len(li) |
| 181 | while b >= 1: |
| 182 | while b + x < len(li) and fn(b + x) > 0: # Change this condition 2 to whatever you like |
| 183 | x += b |
| 184 | b = b // 2 |
| 185 | return x |
nothing calls this directly
no outgoing calls
no test coverage detected