sortedseq_intersectversion
A divide-and-conquer algorithm in OCaml for the intersection of sorted sequences
The algorithm is described in this paper:
Fast Intersection Algorithms for Sorted Sequences Ricardo Baeza-Yates and Alejandro Salinger Algorithms and Applications 2010 (LNCS 6060, pp. 45–61)
| Author | Fermin Reig |
|---|---|
| License | MIT |
| Published | |
| Homepage | https://github.com/ferminr/ocaml_sortedseq_intersect |
| Issue Tracker | https://github.com/ferminr/ocaml_sortedseq_intersect/issues |
| Maintainer | Fermin Reig |
| Dependencies | |
| Source [http] | https://github.com/ferminr/ocaml_sortedseq_intersect/archive/v0.1.0.tar.gz md5=57f23144c9ac13ff526c21d59b3e1a21 sha512=e124cfbb04db5a0f26e81c4c824c58a9ea4a11670ded7380065d316e79887f6b3494210cbfc406bf8b825c269512106a080e39b2575231ae8fa97b9ec9a79c81 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/sortedseq_intersect/sortedseq_intersect.0.1.0/opam |
No package is dependent
