xs The array to sort
sortfn Optionally, a user-defined comparison function.
Sort an array in-place using the quicksort algorithm. By default this uses the Builtins.compare(3kaya) function and sorts in ascending order, but it can instead use a user supplied compare function.
Comparison functions should return 0 if the values are identical, less than zero if the first value passed to the function is 'smaller', and more than zero if the second value is 'bigger'. In this context, 'smaller' values are moved to the start of the array, and 'bigger' values to the end. The following example has a simple function to sort an array of Int s into descending order.
Values that are identical for the purposes of the sorting function will be placed in an undefined order relative to each other.
The Array.sorted(3kaya) function returns a sorted copy of the array, rather than sorting in place.
Signing in to our system allows you to post your contributions and vote on the contributions of others. It will also allow you to get extra perts like having your favorites in the cloud and having your persistent personal notes wherever you go. More will be added as we scale up our services.
By signing in to our system, you agree our Member Terms and Conditions
Sign-in with one of the following services
Please select a screen name for NET SOUP.