Hi Tim!
20 Mar 98 18:14, Tim Hutzler (1:119/88) wrote to Kurt Kuzba:
 TH> OTOH, a heap is only slightly more complex, but its effiency is
 TH> O(log2N),
Shouldn't that be at least O(N * log2 N)? How could a sort algorithm ever be 
faster than O(N), which would IMHO mean that it wouldn't even have to access 
every element.
Ciao, Bernhard!
request message receipt for PGP2.6.2 public key
--- GoldED/2 2.50+
(2:313/37.42)
---------------