A multithreaded implementation that reads a list of integer values and calculates median
-
Updated
May 3, 2018 - Java
A multithreaded implementation that reads a list of integer values and calculates median
Java code for randomized and deterministic QuickSelect algorithms, as well as a naive sorting algorithm. QuickSelect provides efficient selection of specific elements within an unsorted array. The code includes both randomized and deterministic pivot selection strategies comparing with naive built-in implementation.
experiment to compare different algorithms for finding median
StrMeanLib is a free open-source library implementing different heuristic algorithms for the median string problem.
Algos
Add a description, image, and links to the median-finding topic page so that developers can more easily learn about it.
To associate your repository with the median-finding topic, visit your repo's landing page and select "manage topics."