title: Given N marbles and M floors, find the algorithm to find the lowest floor from which marble would break
body: <p>It is related to this questioN : <a href="https://stackoverflow.com/questions/6547/two-marbles">Two marbles and a 100 story building</a>
  BUT it is not the same ...
  We are to figure out best algorithm to figure out, strategy to minimize maximum drops required to find lowest floor ..</p>
  <p>Here is what I have on top of my mind</p>
  <blockquote>
  <p>The last marble has to be dropped in stepwise fashion</p>
  <p>Rest of the marbles will choose a hop (say hop-n)</p>
  <p>e.g..  So when N = 2, M = 100, We know that  maximum drops=14
  and  hop-1 = the floor from which first marble will be dropped for very first time.</p>
  </blockquote>