# Problem Description # Given a sorted sequence of integers in ascending order. # Implement a function that performs binary search for an element in this sequence. # The function should: # 1. Take two arguments: # - a sorted list of numbers, # - a target value to search for. # 2. Return the index of the found element if it exists. # 3. Return -1 if the element is not in the list. # Requirements # - The solution must be iterative. # - It is important to maintain a time complexity of O(log n). # - The code should be written in Python 3 and adhere to basic principles of clean code.
Middle+
111