Since n grows faster than log(n) as n goes to positive infinity, something O(log(n) / n) would actually get faster as n increases. I can't think of any useful algorithm that would exhibit that behavior.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.