Algorithm/Searching.pm untested

filter: Statementstmt 0.0% 0 / 37 Branchbran 0.0% 0 / 6 Conditioncond n/a MC/DCmcdc n/a Subroutinesub 0.0% 0 / 8 Podpod 0.0% 0 / 4 totaltotal 0.0% 0 / 55 CC 4 SCAR 17.0
CC
4
Cov
0%
BinarySearch
12.0
SequentialSearch
6.0
BEGIN
2.0
CRAP 5.5
1 package Algorithm::Searching;
2  
3 use strict;
4 use warnings;
5  
6 our $VERSION = '0.05';
7  
8  
9  
10 BEGIN {
11 use Exporter();
12 use Algorithm::Sorting;
13 our @ISA=qw(Exporter);
14 our @EXPORT=qw(&SequentialSearch &BinarySearch);
15 }
16  
17  
18  
19 sub SequentialSearch {
20 my ($list, $key)=@_;
21 my $size=$#$list+1;
22 my $t;
23
24 for($t=0; $t<$size; ++$t) {
25 return $t if("$key" eq "$list->[$t]");
26 }
27 return -1;
28 }
29  
30 sub BinarySearch {
31 my ($list, $key)=@_;
32  
33 my ($low, $high, $mid);
34 $low=0;
35 $high=$#$list;
36 while($low<=$high) {
37 $mid=int(($low+$high)/2);
38 if($key lt $list->[$mid]) {
39 $high=$mid-1;
40 }
41 elsif($key gt $list->[$mid]) {
42 $low=$mid+1;
43 }
44 else {
45 return $mid;
46 }
47 }
48 return -1;
49 }
50
51  
52 return 1;
53  
54 END {}
55  
56  
57 __END__