Horner's rule for polynomial evaluation: Difference between revisions
Content added Content deleted
(+ МК-61) |
(→{{header|Perl}}: adding recursive version) |
||
Line 918: | Line 918: | ||
my $x = 3; |
my $x = 3; |
||
print horner(\@coeff, $x), "\n";</lang> |
print horner(\@coeff, $x), "\n";</lang> |
||
===Recursive version=== |
|||
<lang perl>sub horner { |
|||
return 0 unless my @coeff = @{shift()}; |
|||
my $x = shift; |
|||
shift(@coeff) + $x * horner( [@coeff], $x ); |
|||
} |
|||
print horner( [ -19, 7, -4, 6 ], 3 );</lang> |
|||
=={{header|Perl 6}}== |
=={{header|Perl 6}}== |