||Programming Language C++
||Detlef Vollmann, firstname.lastname@example.org
P0523r0: Wording for CH 10: Complexity of parallel algorithms
In 25.2.5 [algorithms.parallel.overloads] add another paragraph after p2:
In 25.4.4p4 [alg.transform], change:
Exactly last1 - first1 applications of op or binary_op.
In 25.5.4p8 [alg.merge], change:
When enough additional memory is available,
(last - first) - 1 comparisons.
If no additional memory is available, an algorithm with complexity
N log(N) may be used, where N = last - first.
Thanks to Pete Becker for help with the wording.