I see Sort.sort is really Sort.quicksort. I think Java and Python have both agreed Modified Timsort beats both Quicksort and Merge Sort for speed, accuracy and stability. Is anyone adding an implementation?
I also see that Sort.quicksort is explicitly stated as being sequential (which it is), Merge Sort can be parallelised. I need to find out about Modified Timsort and whether there is a parallel version. -- Russel. ============================================================================= Dr Russel Winder t: +44 20 7585 2200 voip: sip:[email protected] 41 Buckmaster Road m: +44 7770 465 077 xmpp: [email protected] London SW11 1EN, UK w: www.russel.org.uk skype: russel_winder
signature.asc
Description: This is a digitally signed message part
------------------------------------------------------------------------------
_______________________________________________ Chapel-developers mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/chapel-developers
