A Binary Search Example which has O(log n) time complexity.
(arr: List[int], lb: int, ub: int, target: int)
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected