function binary-search(L,V) set start = 1 set end = N repeat while start <= end set middle = (start + end) div 2 if V = L[middle] return success else-if V < L[middle] set end = middle - 1 else-if (V > L[middle]) set start = middle + 1 end-if end-repeat return failure end-function
Notes: div is integer division (discard any remainder)