Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
DannyBee
on Dec 1, 2015
|
parent
|
context
|
favorite
| on:
An interesting data structure with search time O(s...
Errr, what? natural log grows slower than sqrt(n)
http://www.wolframalpha.com/input/?i=sqrt%281e55%29+%3E+log%...
mden
on Dec 1, 2015
[–]
I think that's the point he is making as well. Except it might be confusing that he is using numbers for log(n) and number of digits for srqt(n).
drfuchs
on Dec 1, 2015
|
parent
[–]
Exactly; it shows just how wildly faster sqrt(n) grows than log(n).
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
http://www.wolframalpha.com/input/?i=sqrt%281e55%29+%3E+log%...