function P = legendre_p(n)
- ## Return the nth legendre polynomial.
+ ## Return the `n`th Legendre polynomial.
##
- ## INPUTS:
+ ## INPUT:
##
## * ``n`` - The index of the polynomial that we want.
##
- ## OUTPUTS:
+ ## OUTPUT:
##
## * ``P`` - A polynomial function of one argument.
##
## The second base case.
P = @(x) x;
else
- ## Compute recursively.
+ ## Not one of the base cases, so use the recursive formula.
prev = legendre_p(n-1);
prev_prev = legendre_p(n-2);
P = @(x) (1/n).*( (2*n - 1).*x.*prev(x) - (n-1).*prev_prev(x) );