|
|
|
|
|
Adrian Dumitrescu
We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap that handles a dynamic version in which upon request (i) a new element is inserted or (ii) ...
ver más
|
|
|
|
|