Cody

Solution 275975

Submitted on 8 Jul 2013 by Matt Kindig
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
x = [1 2 3 4 5]; n = 2; y_correct = [1 0 0 2 0 0 3 0 0 4 0 0 5 0 0]; assert(isequal(insert_zeros(x,n),y_correct))
2   Pass
x = [1 2 3 4 5]; n = 1; y_correct = [1 0 2 0 3 0 4 0 5 0]; assert(isequal(insert_zeros(x,n),y_correct))
3   Pass
x = [1 2]; n = 5; y_correct = [1 0 0 0 0 0 2 0 0 0 0 0]; assert(isequal(insert_zeros(x,n),y_correct))
4   Pass
x = 1:10; n = 1; y_correct = [1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0]; assert(isequal(insert_zeros(x,n),y_correct))
5   Pass
x = 1:4; n = 10; y_correct = [1 0 0 0 0 0 0 0 0 0 0 ... 2 0 0 0 0 0 0 0 0 0 0 ... 3 0 0 0 0 0 0 0 0 0 0 ... 4 0 0 0 0 0 0 0 0 0 0]; assert(isequal(insert_zeros(x,n),y_correct))
6   Pass
x = -3:3; n = 3; y_correct = [-3 0 0 0 -2 0 0 0 -1 0 0 0 0 0 0 0 ... 1 0 0 0 2 0 0 0 3 0 0 0]; assert(isequal(insert_zeros(x,n),y_correct))
7   Pass
x = [11 17 42 81 39]; n = 2; y_correct = [11 0 0 17 0 0 42 0 0 81 0 0 39 0 0]; assert(isequal(insert_zeros(x,n),y_correct))
8   Pass
x = 2:3:20; n = 1; y_correct = [2 0 5 0 8 0 11 0 14 0 17 0 20 0]; assert(isequal(insert_zeros(x,n),y_correct))