diff options
| author | MZuenni <michi.zuendorf@gmail.com> | 2024-08-13 17:14:17 +0200 |
|---|---|---|
| committer | MZuenni <michi.zuendorf@gmail.com> | 2024-08-13 17:14:17 +0200 |
| commit | f32a00178f0d3b2152a6fc1dc492c987aaede85f (patch) | |
| tree | fbc52e3475de069ed8b63513f98105bbc0728d6c /test/math | |
| parent | 6fd4266de544582c0609a2fa204e0e49cd390c6e (diff) | |
small improvements
Diffstat (limited to 'test/math')
| -rw-r--r-- | test/math/gauss.cpp | 2 | ||||
| -rw-r--r-- | test/math/inversionsMerge.cpp | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/test/math/gauss.cpp b/test/math/gauss.cpp index 37bacce..6e4759d 100644 --- a/test/math/gauss.cpp +++ b/test/math/gauss.cpp @@ -14,7 +14,7 @@ vector<vector<double>> inverseMat(const vector<vector<double>>& m) { mat[i].resize(2*n); mat[i][n+i] = 1; } - gauss(n);//the unique cetc. checks are not usefull since we dont solve an lgs... + gauss(n); //the unique cetc. checks are not usefull since we dont solve an lgs... vector<vector<double>> res(m); for (int i = 0; i < n; i++) { res[i] = vector<double>(mat[i].begin() + n, mat[i].end()); diff --git a/test/math/inversionsMerge.cpp b/test/math/inversionsMerge.cpp index 85ab0d2..acdc555 100644 --- a/test/math/inversionsMerge.cpp +++ b/test/math/inversionsMerge.cpp @@ -16,7 +16,7 @@ void stress_test() { for (ll i = 0; i < 100'000; i++) { int n = Random::integer<int>(1, 100); vector<ll> v(n); - for (ll j = 0; j < n; j++) v[j] = (j-10) * 100000 + Random::integer<ll>(0, 10000);//values must be unique ): + for (ll j = 0; j < n; j++) v[j] = (j-10) * 100000 + Random::integer<ll>(0, 10000); //values must be unique ): shuffle(all(v), Random::rng); ll expected = naive(v); ll got = mergeSort(v); |
