<div class="leaf flex"><div class="inner justify"><p>If the question asks to implement an operator such as power, squareroot or division and want it to be faster than O(n), binary search is usually the approach to go.</p></div> </div>