- Name: perl-List-BinarySearch
- Version: 0.250.0
- Release: 4.mga7
- Epoch:
- Group: Development/Perl
- License: GPL+ or Artistic
- Url: http://search.cpan.org/dist/List-BinarySearch
- Summary: Pure-Perl Binary Search functions
- Architecture: noarch
- Size: 47838
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: umeabot <umeabot>
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).
The binary search algorithm implemented in this module is known as a
_Deferred Detection_ variant on the traditional Binary Search. Deferred
Detection provides *stable searches*. Stable binary search algorithms have
the following characteristics, contrasted with their unstable binary search
cousins:
* * In the case of non-unique keys, a stable binary search will always
return the lowest-indexed matching element. An unstable binary search
would
return the first one found, which may not be the chronological first.
- OptFlags: -O2 -g -pipe -Wformat -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -fstack-protector --param=ssp-buffer-size=4 -fomit-frame-pointer -march=i586 -mtune=generic -fasynchronous-unwind-tables
- Cookie: localhost 1537345277
- Buildhost: localhost