title: Why is Binary Search a divide and conquer algorithm?
body: <p>I was asked if a Binary Search is a divide and conquer algorithm at an exam. My answer was yes, because you divided the problem into smaller subproblems, until you reached your result.</p>
  
  <p>But the examinators asked where the conquer part in it was, which I was unable to answer. They also disapproved that it actually was a divide and conquer algorithm.</p>
  
  <p>But everywhere I go on the web, it says that it is, so I would like to know why, and where the conquer part of it is?</p>