sortedseq_intersect

A divide-and-conquer algorithm in OCaml for the intersection of sorted sequences
README

A divide-and-conquer algorithm in OCaml for the intersection of sorted sequences. The algorithm is described in this paper:

Complexity is O(m log(n/m)), where m,n are the sizes of the sequences. If m is o(n/log n), this algorithm is better than linear merging, which is O(m+n). On the other hand, if m << n, it's better to do m binary searches. An adaptive version of the algorithm further improves the performance on average by switching from divide-and-conquer to linear merge based on the sizes of the sequences.

Install
Maintainers
Sources
v0.1.0.tar.gz
md5=57f23144c9ac13ff526c21d59b3e1a21
sha512=e124cfbb04db5a0f26e81c4c824c58a9ea4a11670ded7380065d316e79887f6b3494210cbfc406bf8b825c269512106a080e39b2575231ae8fa97b9ec9a79c81
Dependencies
dune
>= "2.0.0"
ocaml
>= "4.08.0"
Reverse Dependencies