title: Customizing compare in bsearch()
body: <p>I have an array of addresses that point to integers ( these integers
  are sorted in ascending order).  They have duplicate values.  Ex: 1,
  2, 2, 3, 3, 3, 3, 4, 4......</p>
  
  <p>I am trying to get hold of all the values that are greater than a
  certain value(key). Currently trying to implement it using binary
  search algo -</p>
  
  <pre><code>void *bsearch(
   const void *key,
   const void *base,
   size_t num,
   size_t width,
   int ( __cdecl *compare ) ( const void *, const void *)
  );
  </code></pre>
  
  <p>I am not able to achieve this completely, but for some of them.</p>
  
  <p>Would there be any other way to get hold of all the values of the
  array, with out changing the algorithm I am using?</p>