Start read n, key i=0 i<n read a[i]

i++
545 674 6

low = 0 high =n-1

while ( low <= high) mid = (low + high) / 2

if (key)

high = mid - 1

low = mid + 1

if(key == a[mid])

print Search Unsuccessful

print Search Successful

Stop