make_unique<> является prvalue: https://en.cppreference.com/w/cpp/language/value_c... prvalue: a function call or an overloaded operator expression, whose return type is non-reference
Temporary objects are created ... in the following situations:
when performing member access on a class prvalue.
All temporary objects are destroyed as the last step in evaluating the full-expression
int taken = 0;
for (int i = 0; i < n; ++i) {
if (rand()*(n-i) < k-taken) {
++taken;
// Взять элемент i.
}
}In a function call, value computations and side effects of the initialization of every parameter are indeterminately sequenced with respect to value computations and side effects of any other parameter.
Evaluations of A and B are indeterminately sequenced : they may be performed in any order but may not overlap: either A will be complete before B, or B will be complete before A. The order may be the opposite the next time the same expression is evaluated.
a[0] < b[0] || (a[0] == b[0] && a[1] < b[1]). Не специалист по C#, но возможно массивы уже так и сравниваются там.
int start[K], end[K];
int prev = -1;
for (int i = 0; i < K; ++i) {
int len = N/K + ((i < N%K) ? 1 : 0);
start[i] = prev + 1;
end[i] = start[i] + len;
prev = end[i];
}let objects: HashMap<Uuid, Object>;
std::vector<int> a, b;
a = a0;
b = F(a);
for (int i = 1; i <= n; ++i) {
a = G(b);
b = F(a);
}void F(const vector<int> &a, vector<int>& res);
void G(const vector<int> &b, vector<int>& res);
std::vector<int> a, b;
a = a0;
b = F(a);
for (int i = 1; i <= n; ++i) {
G(b, a);
F(a, b);
}* 1 2 3
-----
1|1 2 3
2|2 2 3
3|3 3 3using my_template<int>;
while (i < M || j < N)if (i < M && (j == N || A[i] < B[j])) {
C[k++] = A[i++];
} else {
C[k++] = B[j++];
}int n = a.size();
int current = n-1;
while (current >= 0) {
while (a[current] > 0 && current < n-1 &&
((a[current+1] == a[current]) || (a[current+1] == 0))) {
a[current+1] += a[current];
a[current] = 0;
++current;
}
--current;
}