Balanced trees

Ethan Furman ethan at stoneleaf.us
Wed Mar 19 16:15:49 CET 2014


On 03/18/2014 06:15 PM, Steven D'Aprano wrote:
> On Tue, 18 Mar 2014 15:21:28 -0700, Dan Stromberg wrote:
>
>> On Tue, Mar 18, 2014 at 3:03 PM, Marko Rauhamaa <marko at pacujo.net>
>> wrote:
>>> Dan Stromberg <drsalists at gmail.com>:
>>> For a proper comparison, I'd like a fixed, identical dataset and set of
>>> operations run against each data structure.
>>>
>>> How about this test program:
>>
>> I used to do essentially this, but it was time-prohibitive and produced
>> harder-to-read graphs - harder to read because the enormous values of
>> the bad trees were dwarfing the values of the good trees.
>
> A log graph may be the solution to that: graph the log of the time rather
> than time itself.

I don't think that will solve the problem of not wanting to wait three days for the test to finish.  ;)

--
~Ethan~



More information about the Python-list mailing list