Abstract
A parallel algorithm is presented for selecting the kth smallest element of a totally ordered (but not sorted) set of n elements, 1⩽k⩽n. The algorithm uses n1−x processors and runs in O(nx) time, 0<x<1, for an optimal total cost of O(n).
Users
Please
log in to take part in the discussion (add own reviews or comments).