daily log 10.08.20

# NAIVE SOLUTION -- O(N)
        # for i, num in enumerate(nums):
        #     if num == target:
        #         return i
        # return -1

        m_idx = floor(len(nums)/2)

        try:
            m_el = nums[m_idx]
        except:
            return -1

        if m_el == target:
            return m_idx

        if m_el > target:



# as a human computer
# I get the middle index (m_idx)
# I look at the middle element (m_el)
# I compare middle element to target element
# if middle == target, return index
# If middle < target, repeat with new middle
# ... until middle == target
# If middle > target, repeat with new middle