aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

tasks a-s

Browse source
This commit is contained in:
Ingy döt Net 2013-04-10 23:57:08 -07:00
parent 47bf37c096
commit b83f433714
12433 changed files with 156208 additions and 123 deletions
Download patch file Download diff file Expand all files Collapse all files

36
Task/Order-two-numerical-lists/Perl/order-two-numerical-lists.pl Normal file
View file

@ -0,0 +1,36 @@
#!/usr/bin/perl -w
use strict ;
sub orderlists {
my $firstlist = shift ;
my $secondlist = shift ;
my $first = shift @{$firstlist } if @{$firstlist} ;
my $second ;
#keep stripping elements from the first list as long as there are any
#or until the second list is used up!
while ( @{$firstlist} ) {
if ( @{$secondlist} ) { #second list is not used up yet!
$second = shift @{$secondlist} ;
if ( $first < $second ) {
return 1 ;
}
if ( $first > $second ) {
return 0 ;
}
}
else { #second list used up, defined to return false
return 0 ;
}
$first = shift @{$firstlist} ;
}
return 0 ; #in all remaining cases return false
}
my @firstnumbers = ( 43 , 33 , 2 ) ;
my @secondnumbers = ( 45 ) ;
if ( orderlists( \@firstnumbers , \@secondnumbers ) ) {
print "The first list comes before the second list!\n" ;
}
else {
print "The first list does not come before the second list!\n" ;
}