sortedseq_intersectversion
A divide-and-conquer algorithm to intersect 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.2.0.tar.gz md5=4cb1652561ad66afe6aed5b4cce8842c sha512=9936c3988dd5dcfca760fa08cd56f8c3ffd1d6b01408d9c5da3f2fc48454ca8de2f0d810ed954c841fe98ac053b611f7ed726d4c54cfe559d02082b9cc86445d |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/sortedseq_intersect/sortedseq_intersect.0.2.0/opam |
No package is dependent
