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

use median of five

Browse source 
Median5 algorithm taken from:

Fast Deterministic Selection
by Andrei Alexandrescu - 2016
This commit is contained in:
Ahmet Inan 2024-03-11 09:17:21 +01:00
commit c86f767cac
1 changed files with 23 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

33
quick_select.hh
View file

@ -19,22 +19,35 @@ static inline void swap(TYPE *a, int i, int j)
}
template <typename TYPE>
static inline void sort(TYPE *a, int i, int j, int k)
static inline void median(TYPE *A, int a, int b, int c, int d, int e)
{
if (a[i] > a[j])
swap(a, i, j);
if (a[i] > a[k])
swap(a, i, k);
if (a[j] > a[k])
swap(a, j, k);
if (A[c] < A[a])
swap(A, a, c);
if (A[d] < A[b])
swap(A, b, d);
if (A[d] < A[c]) {
swap(A, c, d);
swap(A, a, b);
}
if (A[e] < A[b])
swap(A, b, e);
if (A[e] < A[c]) {
swap(A, c, e);
if (A[c] < A[a])
swap(A, a, c);
} else if (A[c] < A[b]) {
swap(A, b, c);
}
}
template <typename TYPE>
static void partition(TYPE *a, int &l, int &h)
{
int m = l + (h - l) / 2;
sort(a, l, m, h);
TYPE pivot = a[m];
int half = (h - l) / 2;
int quarter = (h - l) / 4;
int middle = l + half;
median(a, l, l + quarter, middle, middle + quarter, h);
TYPE pivot = a[middle];
for (int i = l; i <= h;)
if (a[i] < pivot)
swap(a, i++, l++);