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

check entire array

Browse source
This commit is contained in:
Ahmet Inan 2024-03-10 22:53:04 +01:00
commit c0347030c7
1 changed files with 7 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

12
tests/quick_select_test.cc
View file

@ -7,7 +7,6 @@ Copyright 2024 Ahmet Inan <inan@aicodix.de>
#include <random>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <functional>
#include "quick_select.hh"
@ -22,15 +21,18 @@ int main()
typedef std::default_random_engine generator;
typedef std::uniform_int_distribution<int> distribution;
auto rand = std::bind(distribution(1, MAX_N), generator(seed));
int a[MAX_N], b[MAX_N];
int a[MAX_N];
for (int loop = 0; loop < 10000; ++loop) {
int size = rand();
for (int i = 0; i < size; ++i)
a[i] = b[i] = rand();
a[i] = rand();
int k = rand() % size;
std::nth_element(a, a+k, a+size);
int v = DSP::quick_select(b, k, size);
int v = DSP::quick_select(a, k, size);
assert(v == a[k]);
for (int i = 0; i < k; ++i)
assert(a[i] <= a[k]);
for (int i = k + 1; i < size; ++i)
assert(a[i] >= a[k]);
}
std::cerr << "Quick select algorithm test passed!" << std::endl;
return 0;