binary-merge 0.1.0

Minimum comparison merge of two sorted sequences with random access
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

[[bench]]
harness = false
name = "merge"

[dependencies]
[dev-dependencies.criterion]
version = "0.3.5"

[dev-dependencies.proptest]
version = "1.0.0"

[package]
authors = ["Rüdiger Klaehn <rklaehn@protonmail.com>"]
categories = ["Algorithms"]
description = "Minimum comparison merge of two sorted sequences with random access"
edition = "2021"
homepage = "https://github.com/rklaehn"
keywords = ["array", "sorting", "merging"]
license = "MIT OR Apache-2.0"
name = "binary-merge"
readme = "README.md"
repository = "https://github.com/rklaehn/binary-merge"
resolver = "2"
version = "0.1.0"