@@ -60,7 +60,7 @@ function _quicksort!(ys, xs, alg, order, givenpivot = nothing)
6060 # TODO : Calculate extrema during the first pass if it's possible
6161 # to use counting sort.
6262
63- # (1) `quicksort_partition!` -- partition each chunk in parallel
63+ # (1) `quicksort_partition!` -- Partition each chunk in parallel.
6464 xs_chunk_list = _partition (xs, chunksize)
6565 ys_chunk_list = _partition (ys, chunksize)
6666 nchunks = cld (length (xs), chunksize)
@@ -101,14 +101,14 @@ function _quicksort!(ys, xs, alg, order, givenpivot = nothing)
101101 end
102102
103103 # (2) `quicksort_copyback!` -- Copy partitions back to the original
104- # (destination) array `ys` in the natural order
104+ # (destination) array `ys` in the natural order.
105105 @sync for (i, (xs_chunk, below_offset, above_offset)) in
106106 enumerate (zip (xs_chunk_list, below_offsets, above_offsets))
107107 local nb = get (below_offsets, i + 1 , total_nbelows) - below_offsets[i]
108108 @spawn quicksort_copyback! (ys, xs_chunk, nb, below_offset, above_offset)
109109 end
110110
111- # (3) Recursively sort each partion
111+ # (3) Recursively sort each partion.
112112 below = 1 : total_nbelows
113113 above = total_nbelows+ 1 : length (xs)
114114 @sync begin
0 commit comments