← Packages
perl-List-BinarySearch
Binary Search within a sorted array
- Current
- 0.25
- License
- GPL-1.0-or-later OR Artistic-1.0-Perl
Description
A binary search searches sorted lists using a divide and conquer technique. On each iteration the search domain is cut in half, until the result is found. The computational complexity of a binary search is O(log n).
Changelog
PR · 2
Checks
| Monitor | Observation | Last checked |
|---|---|---|
Checked Repository refresh: git fetch exited 128 (authentication) | ||
Checked | ||
Checked | ||
Checked | ||
Not configured No reliable monitor identity/configuration. | — | |
Not applicable No confirmed version upgrade; this monitor is not run. | — | |
Metadata unavailable current: CPAN prerequisite configuration is dynamic or unspecified. | — Last attempted | |
Not configured No reliable monitor identity/configuration. | — | |
Not configured No reliable monitor identity/configuration. | — |