Abstract

We consider some aspects of computer performance of the search for weighted-order statistics in the most general case. In particular, some statistical models of locus of any order statistics in searching sequence are offered. As a consequence of the hypothesis, the corresponding procedures of examination of samples in the sequence are worked out and the respective estimations of a number of operations are obtained. The heuristic algorithm of picking out samples is offered. To conclude, we present results of the calculation experiment.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call