4 ms·
I thought it was widely known, IIRC a number of languages have adopted it as the stdlib default sorting algorithm for either unstable/stable sort (can't remembe
by gavinray 4y ago
I thought it was widely known, IIRC a number of languages have adopted it as the stdlib default sorting algorithm for either unstable/stable sort (can't remember which is it?)
I'm not big into algorithms but I believe that pdqsort and timsort were supposed to be the best two general sorts.
- masklinn 4y ago> either unstable/stable sort (can't remember which is it?) Stable. It’s a hybrid mergesort. Some of the langages which adopted it after Python are Java, Rust, or Swift.
- rufus_foreman 4y agoJava uses it in Arrays.sort: * <p>The implementation was adapted from Tim Peters's list sort for Python * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt"> * TimSort</a>). It uses techniques from Peter McIlroy's "Optimistic * Sorting and Information Theoretic Complexity", in Proceedings of the * Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, * January 1993.
- valbaca 4y agoJava and Python IIRC
- deleted 4y ago[deleted]
- deleted 4y ago[deleted]