Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 14:30:36 +00:00
Code Issues Projects Releases Packages Wiki Activity

use the new sorting functions

Browse source
This commit is contained in:
Ahmet Inan 2024-03-07 22:04:09 +01:00
commit 957eb6f784
5 changed files with 16 additions and 40 deletions
Download patch file Download diff file Expand all files Collapse all files

4
tests/sort_regression_test.cc
View file

@ -23,13 +23,13 @@ int main()
for (int i = 0; i < size; ++i)
a[i] = b[i] = c[i] = d[i] = rand();
std::sort(a, a+size);
insertion_sort(b, size);
CODE::insertion_sort(b, size);
for (int i = 0; i < size; ++i)
assert(a[i] == b[i]);
for (int i = 0; i < size; ++i)
e[i] = i;
std::stable_sort(e, e+size, [c](int i, int j){ return c[i] < c[j]; });
insertion_sort(f, d, size);
CODE::insertion_sort(f, d, size);
for (int i = 0; i < size; ++i)
assert(e[i] == f[i]);
}