finding nagative number closest to 0 in array (log n complexity)

Question

I have a question: write a function that gets an acsending array of whole numbers and his size. It is given that the array contains at least one negative number and one posi