The version 1.9.0-rc1:
Asking for RadixSort (similarly what one can do for QuickSort)
sort!(prm; alg=Base.Sort.QuickSort, order=Base.Order.Perm(Base.Order.Forward, rows), scratch=scratcha);
fails. Any clues why, and how one might specifically request radix sort?
Good question… You probably need to instantiate the type like Base.Sort.RadixSort()
, which differs in interface slightly from QuickSort <: QuickSortAlg
. Even then, you get
julia> sort(rand(1:10, 5); alg=Base.Sort.RadixSort())
ERROR: ArgumentError: mn is needed but has not been computed
maybe there’s something more to choose that I don’t get?