title: Lower_bound vs binary search
body: <p>I was learning some <a href="https://www.sgi.com/tech/stl/" rel="noreferrer">STL</a> functions and I came across this function
  <a href="http://www.cplusplus.com/reference/algorithm/lower_bound/" rel="noreferrer">lower_bound</a> .I am in a confusion that why doesn't people use <strong>lower_bound</strong> instead of <strong>binary search</strong> as both do the same thing ,both of them have  O(log n) complexity.</p>
  
  <p>Isn't it better to write just one line code with lower_bound than 8-9 lines of if-else statements with binary search or is their any limitation of lower_bound that I didn't know about because of which people don't use it often? </p>