Balanced trees

Chris Angelico rosuav at gmail.com
Mon Mar 10 17:39:18 CET 2014


On Tue, Mar 11, 2014 at 3:33 AM, Tim Chase
<python.list at tim.thechases.com> wrote:
> On 2014-03-11 03:24, Chris Angelico wrote:
>> Imagine, worst case, all one million records have the same
>> song/user/add_time and you need to do twenty comparisons involving
>> four fields. That's gotta be worse than one hashing of five fields.
>
> And if you have one million songs that are indistinguishable, you
> have Pop Top-40 playlists.  And that is *definitely* worse than
> hashes OR trees.  :-)

LOL!

That's not a Comp Sci problem, I'm afraid. But there is a solution:

https://www.youtube.com/watch?v=jCZzvZEmq_A
https://www.youtube.com/watch?v=DEr_5C6JYB4

A different sort of music.

ChrisA



More information about the Python-list mailing list