From 8880501b07405bc9d3b75210ca883eecacffb8e1 Mon Sep 17 00:00:00 2001 From: zhyass Date: Sat, 23 Sep 2023 19:00:34 +0800 Subject: [PATCH] fix typo in merge_sort comment (#1571) --- src/compute/merge_sort/mod.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/compute/merge_sort/mod.rs b/src/compute/merge_sort/mod.rs index 598ba66d318..f57b09bb4a2 100644 --- a/src/compute/merge_sort/mod.rs +++ b/src/compute/merge_sort/mod.rs @@ -74,7 +74,7 @@ use crate::error::Result; /// This is used to keep track of contiguous blocks of slots. /// An array of MergeSlice, `[MergeSlice]`, represents inter-leaved array slices. /// For example, `[(0, 0, 2), (1, 0, 1), (0, 2, 3)]` represents 2 arrays (a0 and a1) arranged as follows: -/// `[a0[0..2], a1[0..1], a0[2..3]]` +/// `[a0[0..2], a1[0..1], a0[2..5]]` /// This representation is useful when building arrays in memory as it allows to memcopy slices of arrays. /// This is particularly useful in merge-sort because sorted arrays (passed to the merge-sort) are more likely /// to have contiguous blocks of sorted elements (than by random).