Re: [boost] [sorting] Taking away quicksort and mergesort

From: Hervé Brönnimann (hervebronnimann_at_[hidden])
Date: 2007-03-17 03:38:58

Rene: What do you mean by "tighter complexity bounds"?  Just curious,
--
Hervé Brönnimann
hervebronnimann_at_[hidden]
On Mar 17, 2007, at 1:16 AM, Rene Rivera wrote:
> Sam Schetterer wrote:
>> Would users care if I took quicksort and merge sort out of the  
>> library? They
>> are already implemented by the stl.
>
> Sorry I haven't looked at your lib yet, I plan to this weekend... But
> perhaps you should compare you quicksort and mergesort  
> implementation to
> the stl ones to see if there are differences. I ask because I have a
> quicksort implementation specifically written, not to be faster,  
> but to
> have tighter complexity bounds.
>
>
> -- 
> -- Grafik - Don't Assume Anything
> -- Redshift Software, Inc. - http://redshift-software.com
> -- rrivera/acm.org - grafik/redshift-software.com
> -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo
> _______________________________________________
> Unsubscribe & other changes: http://lists.boost.org/mailman/ 
> listinfo.cgi/boost