From c05f4ed9972ead0fb5ea3ca32638cb3cf4073f9b Mon Sep 17 00:00:00 2001 From: "edward.zeng" Date: Wed, 10 Nov 2021 20:13:31 +0800 Subject: [PATCH] [skip ci] Fix typo in proxy reduce developer guide (#11578) Signed-off-by: Edward Zeng --- docs/developer_guides/proxy-reduce.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/developer_guides/proxy-reduce.md b/docs/developer_guides/proxy-reduce.md index dac1475568..06a3d1f190 100644 --- a/docs/developer_guides/proxy-reduce.md +++ b/docs/developer_guides/proxy-reduce.md @@ -17,7 +17,7 @@ So the problem degenerates to how to get the maximum number of 10 (TOPK) results ## K-Way Merge Algorithm -Pesudocode of this algorithm is shown below: +Pseudocode of this algorithm is shown below: ```golang n = 4 @@ -52,4 +52,4 @@ The `score_this_way` corresponding to this offset records the maximum value of t This ensures that the result we take each time is the largest among the remaining results. -This algorithm will scan all Search Results linearly at most, hence the time complexity of this algorithm is n \* topk. \ No newline at end of file +This algorithm will scan all Search Results linearly at most, hence the time complexity of this algorithm is n \* topk.