calculate the time complexity of bianry seacth if the binary seach termainates after x iteratiojns code example Example: binary search time complexity Average case:O(log n) Best case:O(1)