title: Find the largest value smaller than x in a sorted array
body: <p>Suppose I have a sorted array of integers <code>int[]</code>, and I want to search the closest smaller value to some input number.</p>
  
  <p>for example if the array contains (1) , (23), (57) , (59), (120) and the input is 109, the output should be 59.</p>
  
  <p>I am just trying to see suggestions and compare to the approaches I already have.</p>