tag

#galloping

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 12. Specialized Search and Sorted-Order Procedures ›

Galloping Intersection Search

Galloping Intersection Search Galloping intersection search computes the intersection of two sorted sequences by combining linear scanning with exponential jumps. When one sequence advances much faster than the other, the algorithm uses exponential search to skip ahead, then refines with binary search. This reduces unnecessary comparisons when the sequences differ significantly in size or distribution. Problem Given two sorted arrays $A$ and $B$, compute all elements that appear in both:...

Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Galloping Merge

Galloping Merge Galloping merge is an optimized merge procedure used in adaptive merge sorts such as Timsort. It starts like ordinary merging, but when one run wins many comparisons in a row, it switches to exponential search to copy a larger block at once. You use it when merging two sorted runs where one run often contains a long streak of smaller elements. Problem Given two sorted runs ( L...