Binary search time complexity in best case for a successful search is code example Example: binary search time complexity Average case:O(log n) Best case:O(1)