In <[EMAIL PROTECTED]>, Perl6 RFC Librarian writes: :Provide multiple sort algorithms, and have a pragma select which Perl :uses; when a program is being compiled, analyze the data and :heuristically select the better algorithm if possible. Analysing at compile time seems real difficult. It would seem a lot easier (either always or optionally) to collect some statistics on the actual sort, and consider whether a different algorithm is worth slotting in for the next time round this code. Hugo
- RFC 304 (v1) C<sort> algorithm to be selectable ... Perl6 RFC Librarian
- Hugo