title: given a sorted array of numbers, how do i find the size of numbers less than x
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/3126703/finding-all-numbers-less-than-x-in-a-bst">finding all numbers less than x in a BST</a>  </p>
  </blockquote>
  
  
  
  <p>How would I modify a binary search to find the number of numbers in a sorted array that are less than a certain number?</p>