[binary.search] Formulate partitioning requirements in the same style as all the other related algorithms do

Author: tkoeppe

source/algorithms.tex

@@ -4196,7 +4196,7 @@
 \tcode{e}
 of
 \range{first}{last}
-are partitioned with respect to the expressions
+shall be partitioned with respect to the expressions
 \tcode{e < value}
 and
 \tcode{!(value < e)}
@@ -4209,11 +4209,11 @@
 of
 \tcode{[first, last)},
 \tcode{e < value}
-implies
+shall imply
 \tcode{!(value < e)}
 or
 \tcode{comp(e, value)}
-implies
+shall imply
 \tcode{!comp(value, e)}.
 
 \pnum