Cody

Solution 292002

Submitted on 30 Jul 2013 by Alfonso Nieto-Castanon
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
%% user_solution = fileread('hermite_poly.m'); assert(isempty(strfind(user_solution,'regexp'))); assert(isempty(strfind(user_solution,'2str'))); assert(isempty(strfind(user_solution,'str2'))); assert(isempty(strfind(user_solution,'interp'))); assert(isempty(strfind(user_solution,'printf'))); assert(isempty(strfind(user_solution,'assert')));
2   Pass
%% n = 0; P_correct = [1]; assert(isequal(hermite_poly(n),P_correct));
3   Pass
%% n = 1; P_correct = [2 0]; assert(isequal(hermite_poly(n),P_correct));
4   Pass
%% n = 2; P_correct = [4 0 -2]; assert(isequal(hermite_poly(n),P_correct));
5   Pass
%% n = 3; P_correct = [8 0 -12 -0]; assert(isequal(hermite_poly(n),P_correct));
6   Pass
%% n = 4; P_correct = [16 0 -48 -0 12]; assert(isequal(hermite_poly(n),P_correct));
7   Pass
%% n = 5; P_correct = [32 0 -160 -0 120 0]; assert(isequal(hermite_poly(n),P_correct));
8   Pass
%% n = 6; P_correct = [64 0 -480 -0 720 0 -120]; assert(isequal(hermite_poly(n),P_correct));
9   Pass
%% n = 7; P_correct = [128 0 -1344 -0 3360 0 -1680 -0]; assert(isequal(hermite_poly(n),P_correct));
10   Pass
%% n = 8; P_correct = [256 0 -3584 -0 13440 0 -13440 -0 1680]; assert(isequal(hermite_poly(n),P_correct));
11   Pass
%% n = 9; P_correct = [512 0 -9216 -0 48384 0 -80640 -0 30240 0]; assert(isequal(hermite_poly(n),P_correct));
12   Pass
%% n = 10; P_correct = [1024 0 -23040 -0 161280 0 -403200 -0 302400 0 -30240]; assert(isequal(hermite_poly(n),P_correct));
13   Pass
%% n = 11; P_correct = [2048 0 -56320 -0 506880 0 -1774080 -0 2217600 0 -665280 -0]; assert(isequal(hermite_poly(n),P_correct));
14   Pass
%% n = 12; P_correct = [4096 0 -135168 -0 1520640 0 -7096320 -0 13305600 0 -7983360 -0 665280]; assert(isequal(hermite_poly(n),P_correct));