tmp/tmp7kv2x3uk/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,12 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#### General <a id="alg.binary.search.general">[[alg.binary.search.general]]</a>
|
| 2 |
+
|
| 3 |
+
All of the algorithms in [[alg.binary.search]] are versions of binary
|
| 4 |
+
search and assume that the sequence being searched is partitioned with
|
| 5 |
+
respect to an expression formed by binding the search key to an argument
|
| 6 |
+
of the comparison function. They work on non-random access iterators
|
| 7 |
+
minimizing the number of comparisons, which will be logarithmic for all
|
| 8 |
+
types of iterators. They are especially appropriate for random access
|
| 9 |
+
iterators, because these algorithms do a logarithmic number of steps
|
| 10 |
+
through the data structure. For non-random access iterators they execute
|
| 11 |
+
a linear number of steps.
|
| 12 |
+
|