Median finding, Order Statistics and Quick Sort
-
Updated
Dec 19, 2018 - C++
Median finding, Order Statistics and Quick Sort
This repository contains the source code of research paper titled: " A generalized quantum algorithm for assuring fairness in random selection among 2^n participants"
An efficient random item sampler that ensures O(1) sampling complexity, and equal selection probability for all items across cycles. Each cycle ensures unique, non-repeating item selections, with each item sampled only once per cycle. Upon cycle completion, the sampler automatically refreshes, initiating a new cycle to repeat the process.
Add a description, image, and links to the random-select topic page so that developers can more easily learn about it.
To associate your repository with the random-select topic, visit your repo's landing page and select "manage topics."