don't make quickselect "destructive"; recompile
This commit is contained in:
parent
c3de336a5b
commit
95e4532c2c
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
@ -6,6 +6,7 @@
|
||||||
#include <stdint.h>
|
#include <stdint.h>
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
|
#include <string.h> // memcpy
|
||||||
|
|
||||||
/* Parallel sampler */
|
/* Parallel sampler */
|
||||||
void sampler_parallel(double (*sampler)(uint64_t* seed), double* results, int n_threads, int n_samples)
|
void sampler_parallel(double (*sampler)(uint64_t* seed), double* results, int n_threads, int n_samples)
|
||||||
|
@ -105,15 +106,24 @@ static int partition(int low, int high, double xs[], int length)
|
||||||
static double quickselect(int k, double xs[], int n)
|
static double quickselect(int k, double xs[], int n)
|
||||||
{
|
{
|
||||||
// https://en.wikipedia.org/wiki/Quickselect
|
// https://en.wikipedia.org/wiki/Quickselect
|
||||||
|
|
||||||
|
double *ys = malloc((size_t)n * sizeof(double));
|
||||||
|
memcpy(ys, xs, (size_t)n * sizeof(double));
|
||||||
|
// ^: don't make this operation "destructive"
|
||||||
|
|
||||||
int low = 0;
|
int low = 0;
|
||||||
int high = n - 1;
|
int high = n - 1;
|
||||||
for (;;) {
|
for (;;) {
|
||||||
if (low == high) {
|
if (low == high) {
|
||||||
return xs[low];
|
double result = ys[low];
|
||||||
|
free(ys);
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
int pivot = partition(low, high, xs, n);
|
int pivot = partition(low, high, ys, n);
|
||||||
if (pivot == k) {
|
if (pivot == k) {
|
||||||
return xs[pivot];
|
double result = ys[pivot];
|
||||||
|
free(ys);
|
||||||
|
return result;
|
||||||
} else if (k < pivot) {
|
} else if (k < pivot) {
|
||||||
high = pivot - 1;
|
high = pivot - 1;
|
||||||
} else {
|
} else {
|
||||||
|
|
Loading…
Reference in New Issue
Block a user