Before revision:  We present an algorithm that, if one knows the number of required samples q in advance, has an overall cost that is sublinear in q, namely, O^*(\sqrt q \cdot(n/\sqrt m)), which is strictly preferable to O^*(q\cdot (n/\sqrt m)) cost resulting from q invocations of the algorithm by Eden and Rosenbaum  .
After revision:  We present an algorithm that, if one knows the number of required samples q in advance, has an overall cost that is sublinear in q, namely, O^*(\sqrt q \cdot(n/\sqrt m)), which is strictly preferable to O^*(q\cdot (n/\sqrt m)) cost resulting from q invocations of the algorithm by Eden and Rosenbaum . Subsequent to a preliminary version of this work, T\v{e .