Big Oh.

[eigen]

Do you guys know if ln(n)/n is asymptotic to anything of interest.

 

[HappyCracker]

Zero and negative infinity. I don't know if I'd call those interesting though.

 

[harrkev]

Yes. It approximates 1/(number of primes less than N).

See here:
http://en.wikipedia.org/wiki/Prime_number_theorem

I am not sure that I would call it "asumptotic" though. More like an approximation.

 

[ghackmann]

Originally posted by: eigen
Do you guys know if ln(n)/n is asymptotic to anything of interest.

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.