return a permutation that sorts a list of strings
SortPermutation( los )
list(string); a list of strings
The SortPermutation( los ) command returns a permutation p that sorts the list los, that is, for which seq⁡lospi,i=1..nops⁡los is equal to sort⁡los. The sorting order is lexicographic.
The permutation returned by SortPermutation is represented as a list of the positive integers from 1 to nops⁡los.
Note that an empty list, which is vacuously a permutation, is returned if the input list los is empty.
All of the StringTools package commands treat strings as (null-terminated) sequences of 8-bit (ASCII) characters. Thus, there is no support for multibyte character encodings, such as unicode encodings.
L ≔ b,c,a:
p ≔ SortPermutation⁡L
Download Help Document
What kind of issue would you like to report? (Optional)