Version française
Home     About     Download     Resources     Contact us    
Browse thread
compiling large file hogs RAM and takes a long time.
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Thomas Fischbacher <tf@f...>
Subject: Re: [Caml-list] Re: compiling large file hogs RAM and takes a long time.
skaller wrote:

> You mention in the ticket there is a hard way out .. using
> binary trees; hard because it would require changes everywhere
> in the compiler. Is this actually enough? Seems to reduce
> 
> 	O(n * n * log n)
> 
> to 
> 
> 	O( n * log n * log n)
 >
> which is still pretty bad.. is that right?

What would be so bad about O(n log n log n)?
After all, in our relevant computing universe, there
always is an upper bound to log n which is quite
a small constant (like 25 or so).

-- 
best regards,
Thomas Fischbacher
tf@functionality.de