Package : perl-List-BinarySearch > RPM : perl-List-BinarySearch-0.250.0-3.mga6.src.rpm
Basic items
Name | perl-List-BinarySearch |
Version | 0.250.0 |
Release | 3.mga6 |
URL | http://search.cpan.org/dist/List-BinarySearch |
Group | Development/Perl |
Summary | Pure-Perl Binary Search functions |
Size | 21KB |
Arch | noarch |
License | GPL+ or Artistic |
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.
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.
Media information
Distribution release | Mageia 6 |
Media name | core-release |
Media arch | armv5tl |
Advanced items
Source RPM | NOT IN DATABASE ?! |
Build time | 2016-06-19 04:52:52 |
Changelog | View in Sophie |
Files | View in Sophie |
Dependencies | View in Sophie |