#partitioning
Wiki
›
Algorithms
›
01. Searching and Sorting
›
12. Specialized Search and Sorted-Order Procedures
›
Merge Path Search
Merge Path Search Merge path search finds partition points in two sorted arrays so that a merge can be split into independent chunks. It is mainly used for parallel merge, GPU merge, and distributed sorted data processing. The method views merging as a path through a grid. Each step consumes one element from either the first array or the second array. A diagonal in this grid represents a fixed number...