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.


This is still very inefficient.

This entry was posted in nerdify. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *

forty − thirty two =