
17 Mar
2007
17 Mar
'07
5:16 a.m.
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