# corner cases
# init boundaries
while(low + 1 < up):
# while up and low are not next to each other
mid = int(low + (up - low)/2)
if(nums[mid] == target):
elif(nums[mid] > target):
else: # (nums[mid] < target)
# check wether up or low
# if not found