Returns the permutation p which causes x to be in sorted order hence x[p[i]] <= x[p[i+1]]. The permutation is the stable sort hence x[p[i]] = x[p[i+1]] \(\rightarrow\) p[i] < p[i+1].
Returns the permutation p which causes x to be in sorted order hence x[p[i]] <= x[p[i+1]]. The permutation is the stable sort hence x[p[i]] = x[p[i+1]] \(\rightarrow\) p[i] < p[i+1].
Returns the permutation p which causes x to be in sorted order hence x[p[i]] <= x[p[i+1]]. The permutation is the stable sort hence x[p[i]] = x[p[i+1]] \(\rightarrow\) p[i] < p[i+1].
Constrains p to be the permutation which causes x to be in sorted order hence x[p[i]] <= x[p[i+1]]. The permutation is the stable sort hence x[p[i]] = x[p[i+1]] \(\rightarrow\) p[i] < p[i+1].
Constrains p to be the permutation which causes x to be in sorted order hence x[p[i]] <= x[p[i+1]]. The permutation is the stable sort hence x[p[i]] = x[p[i+1]] \(\rightarrow\) p[i] < p[i+1].
Requires that the array x is in decreasing order (duplicates are allowed).
Requires that the array x is in decreasing order (duplicates are allowed).
Requires that the array x is in decreasing order (duplicates are allowed).
Requires that the array x is in decreasing order (duplicates are allowed).
Requires that the array x is in increasing order (duplicates are allowed).
Requires that the array x is in increasing order (duplicates are allowed).
Requires that the array x is in increasing order (duplicates are allowed).
Requires that the array x is in increasing order (duplicates are allowed).
Return a multiset of values that is the same as the multiset of values in x but in sorted order.
Requires that the multiset of values in x are the same as the multiset of values in y but y is in sorted order.