From d70a9e55c3595cf7ee84ca9f3b1d5e272a5e3999 Mon Sep 17 00:00:00 2001 From: David Monniaux Date: Sat, 19 Jan 2019 13:42:40 +0100 Subject: use a prime in PRNG --- test/monniaux/quicksort/quicksort.c | 2 +- test/monniaux/quicksort/quicksort_run.c | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) (limited to 'test/monniaux/quicksort') diff --git a/test/monniaux/quicksort/quicksort.c b/test/monniaux/quicksort/quicksort.c index de04bf2d..4b93ae7b 100644 --- a/test/monniaux/quicksort/quicksort.c +++ b/test/monniaux/quicksort/quicksort.c @@ -24,7 +24,7 @@ void quicksort(data *A, int len) { data data_random(void) { static uint64_t next = 1325997111; - next = next * 1103515245 + 12345; + next = next * 1103515249 + 12345; return next; } diff --git a/test/monniaux/quicksort/quicksort_run.c b/test/monniaux/quicksort/quicksort_run.c index c269cc48..f9e1b871 100644 --- a/test/monniaux/quicksort/quicksort_run.c +++ b/test/monniaux/quicksort/quicksort_run.c @@ -6,7 +6,7 @@ int main (void) { cycle_count_config(); - unsigned len=10000; + unsigned len=30000; data *vec = malloc(sizeof(data) * len); data_vec_random(vec, len); cycle_t quicksort_time = get_cycle(); -- cgit