On 23 November 2014 at 20:41, Thierry Dumont <tdum...@math.univ-lyon1.fr> wrote:
> But what about the quick sort? is it sure that the implementation cannot > degenerate? it is well known all the efficiency can be lost if the "key" > used for partition is not chosen as it should be... What about replacing > the quick sort by an other method ? (the tree based one?). qsort is not necessarily quick sort. AFAIK, the C/C++ libraries only guarantee that the sorting has logarithmic complexity in the number of comparisons. std::sort is often implemented as a mix of introsort and other sorting algorithms, with special casing for small/big objects, small/large number of items to be sorted, etc. F. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
