You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
Commit e06cced
Browse filesBrowse the repository at this point in the historyBrowse files
Copy file name to clipboardExpand all lines: docs/standard-library/algorithm-functions.md
+28-25Lines changed: 28 additions & 25 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -326,7 +326,7 @@ The source ranges aren't modified by `binary_search`.
326
326
327
327
The value types of the forward iterators must be less-than comparable to be ordered. That is, given two elements, you can determine either that one is less than the other, or that they're equivalent. (Here, equivalent means that neither is less than the other.) This comparison results in an ordering between the nonequivalent elements.
328
328
329
-
The complexity of the algorithm is logarithmic for random-access iterators and linear otherwise, with the number of steps proportional to (`last` - `first`).
329
+
The complexity of the algorithm is logarithmic for random-access iterators and linear otherwise, with the number of steps proportional to (`last-first`).
330
330
331
331
### Example
332
332
@@ -2382,7 +2382,7 @@ The function object is invoked for each element in the range and doesn't need to
2382
2382
2383
2383
The range referenced must be valid. All pointers must be dereferenceable and, within the sequence, the last position must be reachable from the first by incrementation.
2384
2384
2385
-
The complexity is linear, with exactly `last` - `first` calls made to the generator.
2385
+
The complexity is linear, with exactly `last - first` calls made to the generator.
2386
2386
2387
2387
### Example
2388
2388
@@ -6941,39 +6941,42 @@ The complexity is linear. It makes (`last` - `first`) comparisons for equality a
0 commit comments