Cody

Solution 2002300

Submitted on 4 Nov 2019 by Charles Juenger
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
n = 1; y_correct = [2]; assert(isequal(unHanoingProblem(n),y_correct))

mytry = 2

2   Pass
n = 3; y_correct = [1 3 3 7]; assert(isequal(unHanoingProblem(3),[2 3 1 2 3 1 2]))

mytry = 2 3 1 2 3 1 2

3   Pass
n = 6; y_correct = [2 3 1 2 3 1 2]; assert(isequal(unHanoingProblem(n),[3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1]))

mytry = Columns 1 through 30 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 Columns 31 through 60 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 Columns 61 through 63 3 2 1

Suggested Problems

More from this Author3