mirror of https://github.com/milvus-io/milvus.git
parent
7cb35e4172
commit
a2464c860b
|
@ -42,7 +42,7 @@ for i -> topk:
|
|||
topk_results = append(topk_results, choice)
|
||||
```
|
||||
|
||||
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 reduce merges multiple results.
|
||||
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.
|
||||
|
||||
|
|
Loading…
Reference in New Issue