 -> int</code> such that
   <code>find arr word</code> is the index of the <code>word</code> in
   the sorted array <code>arr</code> if it occurs in <code>arr</code>
   or -1 if <code>word</code> does not occur in <code>arr</code>.

   <br/>

   The number or array accesses will be counted, to check that you
   obtain the expected algorithmic complexity. Beware that you really
   perform the minimal number of accesses. For instance, if your
   function has to test the contents of a cell twice, be sure to pu