Sorting algorithms/Quicksort: Difference between revisions

#| Recursive, single-thread, random pivot, single-pass, quicksort implementation

sub quicksort(@\a) {

return @a if @a.elems < 2;

my $\pivot = @a.pick;

my %prt{Order} is default([]) = @a.classify: * cmp $pivot;