From 983ee423f30bbb9dcc253a33edb72031b1678700 Mon Sep 17 00:00:00 2001 From: Bennu Date: Thu, 9 Dec 2021 19:49:07 +0800 Subject: [PATCH] [skip ci] Fix grammar (#13106) Signed-off-by: Bennu --- docs/developer_guides/proxy-reduce.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/developer_guides/proxy-reduce.md b/docs/developer_guides/proxy-reduce.md index ed7f0ceec1..a4b8ac06cf 100644 --- a/docs/developer_guides/proxy-reduce.md +++ b/docs/developer_guides/proxy-reduce.md @@ -44,7 +44,7 @@ for i -> topk: This algorithm is originated from the merging phase of merge sort. The common point of the two is that the results have been sorted when merging, and the difference is that merge sort merges two-way results, proxy reduces merges multiple results. -In contrast, in merge sort, two pointers are used to record the offsets of the two-way results, and proxy reduce uses multiple pointers `locs` to record the offsets of the `k-way` results. +In contrast, in merge sort, two pointers are used to record the offsets of the two-way results, and proxy reduces uses multiple pointers `locs` to record the offsets of the `k-way` results. In our specific situation, n indicates that there are 4 results to be merged, `multiple_results` is an array of four `topk`, and each `choiceOffset` in `locs` records the offset of each way being merged.