title: Finding cube root of a number less than 1 using binary search
body: <p>I am doing <code>MIT6.00.1x course on edX</code> and the professor tells that <strong>"If x&lt;1, search space is 0 to x but cube root is greater than x and less than 1"</strong>.<br>
  There are two cases :
  <br>
   1. The number x is between 0 and 1
  <br>
  2. The number x is less than 0 (negative)
  <br>
  In both the cases, the cube root of x will lie between <code>x and 1</code>. I understood that. But what about the <strong>search space</strong>? Will the initial search space lie between 0 and x? I think it is not that. I think the bold text as cited from the lecture is a flaw! Please enlighten me on this.</p>