|
|
1f685a95f2
|
Implement Wirth algorithm
It's fast!
|
2020-10-17 00:43:28 +02:00 |
|
|
|
35488b55cd
|
Add Makefile
|
2020-10-14 19:38:13 +02:00 |
|
|
|
04a25454ac
|
fixed coding guidelines and added a lot of testcode
|
2020-10-14 00:26:32 +02:00 |
|
|
|
fec5e8a6e7
|
added TODO and common header for unification
|
2020-10-14 00:25:03 +02:00 |
|
|
|
c29c08cea7
|
added variant of median of medians for arrays
|
2020-10-06 18:34:26 +02:00 |
|
|
|
9ea381fdba
|
moved comparator before main in function; adding std::sort (introsort)
|
2020-10-06 18:11:19 +02:00 |
|
|
|
68ce4f7887
|
handling only for odd datasets; added quicksort for array
|
2020-10-06 17:43:20 +02:00 |
|
|
|
7c6258c3f4
|
Merge branch 'main' of https://github.com/kb173/median-comparison into main
|
2020-10-06 17:11:38 +02:00 |
|
|
|
cbb4886dd2
|
Generate uneven number of test numbers
Also remove the trailing \n
|
2020-10-06 17:10:49 +02:00 |
|
|
|
22671e83fd
|
Generate even number of test numbers
Also remove the trailing \n
|
2020-10-06 17:04:42 +02:00 |
|
|
|
f3688bbc7f
|
using size_t (uint32) instead of int because only use positive values
|
2020-10-06 16:28:39 +02:00 |
|
|
|
1883659921
|
added implementation for median of medians and randomized select
|
2020-10-06 16:28:09 +02:00 |
|
|
|
90bb76cb3c
|
removed output for readline
|
2020-10-06 16:27:28 +02:00 |
|
|
|
3b6d9f349f
|
added stubs for remaining median algorithms
|
2020-10-06 15:10:36 +02:00 |
|
|
|
f072f162b2
|
added implementation for median after quicksort and std nth element
|
2020-10-06 15:01:50 +02:00 |
|
|
|
6b60d6e44b
|
just return a copy of the input array (TODO: use pointer as param)
|
2020-10-06 14:45:30 +02:00 |
|
|
|
43ca1db1bb
|
basic project setup
|
2020-10-06 14:34:16 +02:00 |
|
|
|
f6b897063c
|
Add Python script for test data + a generated list
Note: The first number is the number of entries to expect!
|
2020-10-06 13:13:53 +02:00 |
|
|
|
b05dd3538a
|
Initial commit
|
2020-10-06 13:01:44 +02:00 |
|
