You can tell you’re talking to a group of mathematicians and computer scientists when you follow the statement (made in reference to coding a spell checker based on a dictionary of sixteen million words):
By using a binary tree, we can cut the average search time from 16 MILLION comparisons to 24 comparisons.
Comments 3
ruby on rails:: god level rulezzzzzzzzzzzzzzzzz
а вот ты какую то хуйню несешь :)))
PS:
Unstructured data:: rulezzzzzzzzzzzzzzzzzzzzzzzzz
Web2.0 media trash:: god level rulezzzzzzzzzzzzzzzzzzz
Structured data:: suxxxxxxxxxxxxxxxxxxxxx
:)))) Извини, просто эмоций много ;)
Reply
By using a binary tree, we can cut the average search time from 16 MILLION comparisons to 24 comparisons.
with
This is still very inefficient.
Отсюда: http://komplexify.com/blog/2009/03/27/perspective-2/
Reply
Reply
Leave a comment