Re^2: Dereferencing arrays

i will check your links, the reason i tried using protypes was i read online somewhere that they were needed for recursive methods. I wont make that mistake again.

Comment on Re^2: Dereferencing arrays

Replies are listed 'Best First'.
Re^3: Dereferencing arrays by Laurent_R (Canon) on Mar 19, 2014 at 22:22 UTC
No, this isn't true, prototypes are not needed for recursive subroutine calls.The typical example of recursive routines is the calculation of the factorial of a number, which may be coded this way: `#!/usr/bin/perl use strict; use warnings; my $input = shift; chomp $input; print factorial($input); sub factorial { my $val = shift; return 1 if $val == 0 or $val == 1; return $val * factorial($val - 1); }` [download] As you can see, no prototype needed. Prototypes can be useful for some advanced constructs, but, as a beginner, just don't use them, at least until you are no longer a beginner and you really know what they are and what they really do.	[reply] [d/l]

Replies are listed 'Best First'.

Re^3: Dereferencing arrays
by Laurent_R (Canon) on Mar 19, 2014 at 22:22 UTC

#!/usr/bin/perl

use strict;
use warnings;

my $input = shift;
chomp $input;
print factorial($input);

sub factorial {
    my $val = shift;
    return 1 if $val == 0 or $val == 1;
    return $val * factorial($val - 1);
}
[download]

[reply]
[d/l]