diff options
Diffstat (limited to 'math/inversionsMerge.cpp')
| -rw-r--r-- | math/inversionsMerge.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/math/inversionsMerge.cpp b/math/inversionsMerge.cpp index 1ea2ada..8235b11 100644 --- a/math/inversionsMerge.cpp +++ b/math/inversionsMerge.cpp @@ -2,26 +2,26 @@ ll merge(vector<ll>& v, vector<ll>& left, vector<ll>& right) { int a = 0, b = 0, i = 0; ll inv = 0; - while (a < (int)left.size() && b < (int)right.size()) { + while (a < sz(left) && b < sz(right)) { if (left[a] < right[b]) v[i++] = left[a++]; else { - inv += left.size() - a; + inv += sz(left) - a; v[i++] = right[b++]; } } - while (a < (int)left.size()) v[i++] = left[a++]; - while (b < (int)right.size()) v[i++] = right[b++]; + while (a < sz(left)) v[i++] = left[a++]; + while (b < sz(right)) v[i++] = right[b++]; return inv; } ll mergeSort(vector<ll> &v) { // Sortiert v und gibt Inversionszahl zurück. - int n = v.size(); + int n = sz(v); vector<ll> left(n / 2), right((n + 1) / 2); for (int i = 0; i < n / 2; i++) left[i] = v[i]; for (int i = n / 2; i < n; i++) right[i - n / 2] = v[i]; ll result = 0; - if (left.size() > 1) result += mergeSort(left); - if (right.size() > 1) result += mergeSort(right); + if (sz(left) > 1) result += mergeSort(left); + if (sz(right) > 1) result += mergeSort(right); return result + merge(v, left, right); } |