A note on continuous search algorithms
L.E. Garey, R. D. Gupta · Journal of Applied Probability · 1987
Continuous random search methods with an average complexity given by O(log(1/ε)) for ε → 0 where ε is a given accuracy were presented in a recent paper. In this article an example of an O(log log(1/ε)) method is presented and illustrated.