Binary search in a sorted list

If the list is already sorted in an ascending order, can you find an effacient algorithm to look for the value v, without havibg to go through the whole list?

Add a variable to count the number of steps executed by your function