# Binary Search
# this is a comment

A=Array[3,7,9,11,15,19,27,29,31,45,56,78,99]

def find(y) 
  low=0
  high=A.length
  while (low < high)
   mid = (low+high)/2
    print ("#{mid}\n")
    if (A[mid]==y) 
       return mid
    elsif (A[mid]<y) 
       low=mid+1
    elsif (A[mid]>y) 
        high=mid-1
    end   
  end

  if (A[low]==y)   
   return low
   else
      return -1
  end
end


if (ARGV.length == 1)
  p = Integer(ARGV[0])
end


print("The index of #{p} is #{find(p)}\n");