Sorting and Related Functions

Julia has an extensive, flexible API for sorting and interacting with already-sorted arrays of values. By default, Julia picks reasonable algorithms and sorts in standard ascending order:

  1. julia> sort([2,3,1])
  2. 3-element Array{Int64,1}:
  3.  1
  4.  2
  5.  3

You can easily sort in reverse order as well:

  1. julia> sort([2,3,1], rev=true)
  2. 3-element Array{Int64,1}:
  3.  3
  4.  2
  5.  1

To sort an array in-place, use the “bang” version of the sort function:

  1. julia> a = [2,3,1];
  3. julia> sort!(a);
  5. julia> a
  6. 3-element Array{Int64,1}:
  7.  1
  8.  2
  9.  3

Instead of directly sorting an array, you can compute a permutation of the array’s indices that puts the array into sorted order:

  1. julia> v = randn(5)
  2. 5-element Array{Float64,1}:
  3.   0.297288
  4.   0.382396
  5.  -0.597634
  6.  -0.0104452
  7.  -0.839027
  9. julia> p = sortperm(v)
  10. 5-element Array{Int64,1}:
  11.  5
  12.  3
  13.  4
  14.  1
  15.  2
  17. julia> v[p]
  18. 5-element Array{Float64,1}:
  19.  -0.839027
  20.  -0.597634
  21.  -0.0104452
  22.   0.297288
  23.   0.382396

Arrays can easily be sorted according to an arbitrary transformation of their values:

  1. julia> sort(v, by=abs)
  2. 5-element Array{Float64,1}:
  3.  -0.0104452
  4.   0.297288
  5.   0.382396
  6.  -0.597634
  7.  -0.839027

Or in reverse order by a transformation:

  1. julia> sort(v, by=abs, rev=true)
  2. 5-element Array{Float64,1}:
  3.  -0.839027
  4.  -0.597634
  5.   0.382396
  6.   0.297288
  7.  -0.0104452

If needed, the sorting algorithm can be chosen:

  1. julia> sort(v, alg=InsertionSort)
  2. 5-element Array{Float64,1}:
  3.  -0.839027
  4.  -0.597634
  5.  -0.0104452
  6.   0.297288
  7.   0.382396

All the sorting and order related functions rely on a “less than” relation defining a total order on the values to be manipulated. The isless function is invoked by default, but the relation can be specified via the lt keyword.

Sorting Functions

Base.sort! — Function

  1. sort!(v; alg::Algorithm=defalg(v), lt=isless, by=identity, rev::Bool=false, order::Ordering=Forward)

Sort the vector v in place. QuickSort is used by default for numeric arrays while MergeSort is used for other arrays. You can specify an algorithm to use via the alg keyword (see Sorting Algorithms for available algorithms). The by keyword lets you provide a function that will be applied to each element before comparison; the lt keyword allows providing a custom “less than” function; use rev=true to reverse the sorting order. These options are independent and can be used together in all possible combinations: if both by and lt are specified, the lt function is applied to the result of the by function; rev=true reverses whatever ordering specified via the by and lt keywords.

Examples

  1. julia> v = [3, 1, 2]; sort!(v); v
  2. 3-element Array{Int64,1}:
  3.  1
  4.  2
  5.  3
  7. julia> v = [3, 1, 2]; sort!(v, rev = true); v
  8. 3-element Array{Int64,1}:
  9.  3
  10.  2
  11.  1
  13. julia> v = [(1, "c"), (3, "a"), (2, "b")]; sort!(v, by = x -> x[1]); v
  14. 3-element Array{Tuple{Int64,String},1}:
  15.  (1, "c")
  16.  (2, "b")
  17.  (3, "a")
  19. julia> v = [(1, "c"), (3, "a"), (2, "b")]; sort!(v, by = x -> x[2]); v
  20. 3-element Array{Tuple{Int64,String},1}:
  21.  (3, "a")
  22.  (2, "b")
  23.  (1, "c")

source

  1. sort!(A; dims::Integer, alg::Algorithm=defalg(A), lt=isless, by=identity, rev::Bool=false, order::Ordering=Forward)

Sort the multidimensional array A along dimension dims. See sort! for a description of possible keyword arguments.

To sort slices of an array, refer to sortslices.

Julia 1.1

This function requires at least Julia 1.1.

Examples

  1. julia> A = [4 3; 1 2]
  2. 2×2 Array{Int64,2}:
  3.  4  3
  4.  1  2
  6. julia> sort!(A, dims = 1); A
  7. 2×2 Array{Int64,2}:
  8.  1  2
  9.  4  3
  11. julia> sort!(A, dims = 2); A
  12. 2×2 Array{Int64,2}:
  13.  1  2
  14.  3  4

source

Base.sort — Function

  1. sort(v; alg::Algorithm=defalg(v), lt=isless, by=identity, rev::Bool=false, order::Ordering=Forward)

Variant of sort! that returns a sorted copy of v leaving v itself unmodified.

Examples

  1. julia> v = [3, 1, 2];
  3. julia> sort(v)
  4. 3-element Array{Int64,1}:
  5.  1
  6.  2
  7.  3
  9. julia> v
  10. 3-element Array{Int64,1}:
  11.  3
  12.  1
  13.  2

source

  1. sort(A; dims::Integer, alg::Algorithm=DEFAULT_UNSTABLE, lt=isless, by=identity, rev::Bool=false, order::Ordering=Forward)

Sort a multidimensional array A along the given dimension. See sort! for a description of possible keyword arguments.

To sort slices of an array, refer to sortslices.

Examples

  1. julia> A = [4 3; 1 2]
  2. 2×2 Array{Int64,2}:
  3.  4  3
  4.  1  2
  6. julia> sort(A, dims = 1)
  7. 2×2 Array{Int64,2}:
  8.  1  2
  9.  4  3
  11. julia> sort(A, dims = 2)
  12. 2×2 Array{Int64,2}:
  13.  3  4
  14.  1  2

source

Base.sortperm — Function

  1. sortperm(v; alg::Algorithm=DEFAULT_UNSTABLE, lt=isless, by=identity, rev::Bool=false, order::Ordering=Forward)

Return a permutation vector I that puts v[I] in sorted order. The order is specified using the same keywords as sort!. The permutation is guaranteed to be stable even if the sorting algorithm is unstable, meaning that indices of equal elements appear in ascending order.

See also sortperm!.

Examples

  1. julia> v = [3, 1, 2];
  3. julia> p = sortperm(v)
  4. 3-element Array{Int64,1}:
  5.  2
  6.  3
  7.  1
  9. julia> v[p]
  10. 3-element Array{Int64,1}:
  11.  1
  12.  2
  13.  3

source

Base.Sort.InsertionSort — Constant

  1. InsertionSort

Indicate that a sorting function should use the insertion sort algorithm. Insertion sort traverses the collection one element at a time, inserting each element into its correct, sorted position in the output list.

Characteristics:

  • stable: preserves the ordering of elements which compare equal (e.g. “a” and “A” in a sort of letters which ignores case).
  • in-place in memory.
  • quadratic performance in the number of elements to be sorted: it is well-suited to small collections but should not be used for large ones.

source

Base.Sort.MergeSort — Constant

  1. MergeSort

Indicate that a sorting function should use the merge sort algorithm. Merge sort divides the collection into subcollections and repeatedly merges them, sorting each subcollection at each step, until the entire collection has been recombined in sorted form.

Characteristics:

  • stable: preserves the ordering of elements which compare equal (e.g. “a” and “A” in a sort of letters which ignores case).
  • not in-place in memory.
  • divide-and-conquer sort strategy.

source

Base.Sort.QuickSort — Constant

  1. QuickSort

Indicate that a sorting function should use the quick sort algorithm, which is not stable.

Characteristics:

  • not stable: does not preserve the ordering of elements which compare equal (e.g. “a” and “A” in a sort of letters which ignores case).
  • in-place in memory.
  • divide-and-conquer: sort strategy similar to MergeSort.
  • good performance for large collections.

source

Base.Sort.PartialQuickSort — Type

  1. PartialQuickSort{T <: Union{Integer,OrdinalRange}}

Indicate that a sorting function should use the partial quick sort algorithm. Partial quick sort returns the smallest k elements sorted from smallest to largest, finding them and sorting them using QuickSort.

Characteristics:

  • not stable: does not preserve the ordering of elements which compare equal (e.g. “a” and “A” in a sort of letters which ignores case).
  • in-place in memory.
  • divide-and-conquer: sort strategy similar to MergeSort.

source

Base.Sort.sortperm! — Function

  1. sortperm!(ix, v; alg::Algorithm=DEFAULT_UNSTABLE, lt=isless, by=identity, rev::Bool=false, order::Ordering=Forward, initialized::Bool=false)

Like sortperm, but accepts a preallocated index vector ix. If initialized is false (the default), ix is initialized to contain the values 1:length(v).

Examples

  1. julia> v = [3, 1, 2]; p = zeros(Int, 3);
  3. julia> sortperm!(p, v); p
  4. 3-element Array{Int64,1}:
  5.  2
  6.  3
  7.  1
  9. julia> v[p]
  10. 3-element Array{Int64,1}:
  11.  1
  12.  2
  13.  3

source

Base.sortslices — Function

  1. sortslices(A; dims, alg::Algorithm=DEFAULT_UNSTABLE, lt=isless, by=identity, rev::Bool=false, order::Ordering=Forward)

Sort slices of an array A. The required keyword argument dims must be either an integer or a tuple of integers. It specifies the dimension(s) over which the slices are sorted.

E.g., if A is a matrix, dims=1 will sort rows, dims=2 will sort columns. Note that the default comparison function on one dimensional slices sorts lexicographically.

For the remaining keyword arguments, see the documentation of sort!.

Examples

  1. julia> sortslices([7 3 5; -1 6 4; 9 -2 8], dims=1) # Sort rows
  2. 3×3 Array{Int64,2}:
  3.  -1   6  4
  4.   7   3  5
  5.   9  -2  8
  7. julia> sortslices([7 3 5; -1 6 4; 9 -2 8], dims=1, lt=(x,y)->isless(x[2],y[2]))
  8. 3×3 Array{Int64,2}:
  9.   9  -2  8
  10.   7   3  5
  11.  -1   6  4
  13. julia> sortslices([7 3 5; -1 6 4; 9 -2 8], dims=1, rev=true)
  14. 3×3 Array{Int64,2}:
  15.   9  -2  8
  16.   7   3  5
  17.  -1   6  4
  19. julia> sortslices([7 3 5; 6 -1 -4; 9 -2 8], dims=2) # Sort columns
  20. 3×3 Array{Int64,2}:
  21.   3   5  7
  22.  -1  -4  6
  23.  -2   8  9
  25. julia> sortslices([7 3 5; 6 -1 -4; 9 -2 8], dims=2, alg=InsertionSort, lt=(x,y)->isless(x[2],y[2]))
  26. 3×3 Array{Int64,2}:
  27.   5   3  7
  28.  -4  -1  6
  29.   8  -2  9
  31. julia> sortslices([7 3 5; 6 -1 -4; 9 -2 8], dims=2, rev=true)
  32. 3×3 Array{Int64,2}:
  33.  7   5   3
  34.  6  -4  -1
  35.  9   8  -2

Higher dimensions

sortslices extends naturally to higher dimensions. E.g., if A is a a 2x2x2 array, sortslices(A, dims=3) will sort slices within the 3rd dimension, passing the 2x2 slices A[:, :, 1] and A[:, :, 2] to the comparison function. Note that while there is no default order on higher-dimensional slices, you may use the by or lt keyword argument to specify such an order.

If dims is a tuple, the order of the dimensions in dims is relevant and specifies the linear order of the slices. E.g., if A is three dimensional and dims is (1, 2), the orderings of the first two dimensions are re-arranged such such that the slices (of the remaining third dimension) are sorted. If dims is (2, 1) instead, the same slices will be taken, but the result order will be row-major instead.

Higher dimensional examples

  1. julia> A = permutedims(reshape([4 3; 2 1; 'A' 'B'; 'C' 'D'], (2, 2, 2)), (1, 3, 2))
  2. 2×2×2 Array{Any,3}:
  3. [:, :, 1] =
  4.  4  3
  5.  2  1
  7. [:, :, 2] =
  8.  'A'  'B'
  9.  'C'  'D'
  11. julia> sortslices(A, dims=(1,2))
  12. 2×2×2 Array{Any,3}:
  13. [:, :, 1] =
  14.  1  3
  15.  2  4
  17. [:, :, 2] =
  18.  'D'  'B'
  19.  'C'  'A'
  21. julia> sortslices(A, dims=(2,1))
  22. 2×2×2 Array{Any,3}:
  23. [:, :, 1] =
  24.  1  2
  25.  3  4
  27. [:, :, 2] =
  28.  'D'  'C'
  29.  'B'  'A'
  31. julia> sortslices(reshape([5; 4; 3; 2; 1], (1,1,5)), dims=3, by=x->x[1,1])
  32. 1×1×5 Array{Int64,3}:
  33. [:, :, 1] =
  34.  1
  36. [:, :, 2] =
  37.  2
  39. [:, :, 3] =
  40.  3
  42. [:, :, 4] =
  43.  4
  45. [:, :, 5] =
  46.  5

source

Order-Related Functions

Base.issorted — Function

  1. issorted(v, lt=isless, by=identity, rev:Bool=false, order::Ordering=Forward)

Test whether a vector is in sorted order. The lt, by and rev keywords modify what order is considered to be sorted just as they do for sort.

Examples

  1. julia> issorted([1, 2, 3])
  2. true
  4. julia> issorted([(1, "b"), (2, "a")], by = x -> x[1])
  5. true
  7. julia> issorted([(1, "b"), (2, "a")], by = x -> x[2])
  8. false
  10. julia> issorted([(1, "b"), (2, "a")], by = x -> x[2], rev=true)
  11. true

source

Base.Sort.searchsorted — Function

  1. searchsorted(a, x; by=<transform>, lt=<comparison>, rev=false)

Return the range of indices of a which compare as equal to x (using binary search) according to the order specified by the by, lt and rev keywords, assuming that a is already sorted in that order. Return an empty range located at the insertion point if a does not contain values equal to x.

Examples

  1. julia> searchsorted([1, 2, 4, 5, 5, 7], 4) # single match
  2. 3:3
  4. julia> searchsorted([1, 2, 4, 5, 5, 7], 5) # multiple matches
  5. 4:5
  7. julia> searchsorted([1, 2, 4, 5, 5, 7], 3) # no match, insert in the middle
  8. 3:2
  10. julia> searchsorted([1, 2, 4, 5, 5, 7], 9) # no match, insert at end
  11. 7:6
  13. julia> searchsorted([1, 2, 4, 5, 5, 7], 0) # no match, insert at start
  14. 1:0

source

Base.Sort.searchsortedfirst — Function

  1. searchsortedfirst(a, x; by=<transform>, lt=<comparison>, rev=false)

Return the index of the first value in a greater than or equal to x, according to the specified order. Return length(a) + 1 if x is greater than all values in a. a is assumed to be sorted.

Examples

  1. julia> searchsortedfirst([1, 2, 4, 5, 5, 7], 4) # single match
  2. 3
  4. julia> searchsortedfirst([1, 2, 4, 5, 5, 7], 5) # multiple matches
  5. 4
  7. julia> searchsortedfirst([1, 2, 4, 5, 5, 7], 3) # no match, insert in the middle
  8. 3
  10. julia> searchsortedfirst([1, 2, 4, 5, 5, 7], 9) # no match, insert at end
  11. 7
  13. julia> searchsortedfirst([1, 2, 4, 5, 5, 7], 0) # no match, insert at start
  14. 1

source

Base.Sort.searchsortedlast — Function

  1. searchsortedlast(a, x; by=<transform>, lt=<comparison>, rev=false)

Return the index of the last value in a less than or equal to x, according to the specified order. Return 0 if x is less than all values in a. a is assumed to be sorted.

Examples

  1. julia> searchsortedlast([1, 2, 4, 5, 5, 7], 4) # single match
  2. 3
  4. julia> searchsortedlast([1, 2, 4, 5, 5, 7], 5) # multiple matches
  5. 5
  7. julia> searchsortedlast([1, 2, 4, 5, 5, 7], 3) # no match, insert in the middle
  8. 2
  10. julia> searchsortedlast([1, 2, 4, 5, 5, 7], 9) # no match, insert at end
  11. 6
  13. julia> searchsortedlast([1, 2, 4, 5, 5, 7], 0) # no match, insert at start
  14. 0

source

Base.Sort.partialsort! — Function

  1. partialsort!(v, k; by=<transform>, lt=<comparison>, rev=false)

Partially sort the vector v in place, according to the order specified by by, lt and rev so that the value at index k (or range of adjacent values if k is a range) occurs at the position where it would appear if the array were fully sorted via a non-stable algorithm. If k is a single index, that value is returned; if k is a range, an array of values at those indices is returned. Note that partialsort! does not fully sort the input array.

Examples

  1. julia> a = [1, 2, 4, 3, 4]
  2. 5-element Array{Int64,1}:
  3.  1
  4.  2
  5.  4
  6.  3
  7.  4
  9. julia> partialsort!(a, 4)
  10. 4
  12. julia> a
  13. 5-element Array{Int64,1}:
  14.  1
  15.  2
  16.  3
  17.  4
  18.  4
  20. julia> a = [1, 2, 4, 3, 4]
  21. 5-element Array{Int64,1}:
  22.  1
  23.  2
  24.  4
  25.  3
  26.  4
  28. julia> partialsort!(a, 4, rev=true)
  29. 2
  31. julia> a
  32. 5-element Array{Int64,1}:
  33.  4
  34.  4
  35.  3
  36.  2
  37.  1

source

Base.Sort.partialsort — Function

  1. partialsort(v, k, by=<transform>, lt=<comparison>, rev=false)

Variant of partialsort! which copies v before partially sorting it, thereby returning the same thing as partialsort! but leaving v unmodified.

source

Base.Sort.partialsortperm — Function

  1. partialsortperm(v, k; by=<transform>, lt=<comparison>, rev=false)

Return a partial permutation I of the vector v, so that v[I] returns values of a fully sorted version of v at index k. If k is a range, a vector of indices is returned; if k is an integer, a single index is returned. The order is specified using the same keywords as sort!. The permutation is stable, meaning that indices of equal elements appear in ascending order.

Note that this function is equivalent to, but more efficient than, calling sortperm(...)[k].

Examples

  1. julia> v = [3, 1, 2, 1];
  3. julia> v[partialsortperm(v, 1)]
  4. 1
  6. julia> p = partialsortperm(v, 1:3)
  7. 3-element view(::Array{Int64,1}, 1:3) with eltype Int64:
  8.  2
  9.  4
  10.  3
  12. julia> v[p]
  13. 3-element Array{Int64,1}:
  14.  1
  15.  1
  16.  2

source

Base.Sort.partialsortperm! — Function

  1. partialsortperm!(ix, v, k; by=<transform>, lt=<comparison>, rev=false, initialized=false)

Like partialsortperm, but accepts a preallocated index vector ix the same size as v, which is used to store (a permutation of) the indices of v.

If the index vector ix is initialized with the indices of v (or a permutation thereof), initialized should be set to true.

If initialized is false (the default), then ix is initialized to contain the indices of v.

If initialized is true, but ix does not contain (a permutation of) the indices of v, the behavior of partialsortperm! is undefined.

(Typically, the indices of v will be 1:length(v), although if v has an alternative array type with non-one-based indices, such as an OffsetArray, ix must also be an OffsetArray with the same indices, and must contain as values (a permutation of) these same indices.)

Upon return, ix is guaranteed to have the indices k in their sorted positions, such that

  1. partialsortperm!(ix, v, k);
  2. v[ix[k]] == partialsort(v, k)

The return value is the kth element of ix if k is an integer, or view into ix if k is a range.

Examples

  1. julia> v = [3, 1, 2, 1];
  3. julia> ix = Vector{Int}(undef, 4);
  5. julia> partialsortperm!(ix, v, 1)
  6. 2
  8. julia> ix = [1:4;];
  10. julia> partialsortperm!(ix, v, 2:3, initialized=true)
  11. 2-element view(::Array{Int64,1}, 2:3) with eltype Int64:
  12.  4
  13.  3

source

Sorting Algorithms

There are currently four sorting algorithms available in base Julia:

InsertionSort is an O(n^2) stable sorting algorithm. It is efficient for very small n, and is used internally by QuickSort.

QuickSort is an O(n log n) sorting algorithm which is in-place, very fast, but not stable – i.e. elements which are considered equal will not remain in the same order in which they originally appeared in the array to be sorted. QuickSort is the default algorithm for numeric values, including integers and floats.

PartialQuickSort(k) is similar to QuickSort, but the output array is only sorted up to index k if k is an integer, or in the range of k if k is an OrdinalRange. For example:

  1. x = rand(1:500, 100)
  2. k = 50
  3. k2 = 50:100
  4. s = sort(x; alg=QuickSort)
  5. ps = sort(x; alg=PartialQuickSort(k))
  6. qs = sort(x; alg=PartialQuickSort(k2))
  7. map(issorted, (s, ps, qs))             # => (true, false, false)
  8. map(x->issorted(x[1:k]), (s, ps, qs))  # => (true, true, false)
  9. map(x->issorted(x[k2]), (s, ps, qs))   # => (true, false, true)
  10. s[1:k] == ps[1:k]                      # => true
  11. s[k2] == qs[k2]                        # => true

MergeSort is an O(n log n) stable sorting algorithm but is not in-place – it requires a temporary array of half the size of the input array – and is typically not quite as fast as QuickSort. It is the default algorithm for non-numeric data.

The default sorting algorithms are chosen on the basis that they are fast and stable, or appear to be so. For numeric types indeed, QuickSort is selected as it is faster and indistinguishable in this case from a stable sort (unless the array records its mutations in some way). The stability property comes at a non-negligible cost, so if you don’t need it, you may want to explicitly specify your preferred algorithm, e.g. sort!(v, alg=QuickSort).

The mechanism by which Julia picks default sorting algorithms is implemented via the Base.Sort.defalg function. It allows a particular algorithm to be registered as the default in all sorting functions for specific arrays. For example, here are the two default methods from sort.jl:

  1. defalg(v::AbstractArray) = MergeSort
  2. defalg(v::AbstractArray{<:Number}) = QuickSort

As for numeric arrays, choosing a non-stable default algorithm for array types for which the notion of a stable sort is meaningless (i.e. when two values comparing equal can not be distinguished) may make sense.