Cody

# Problem 21. Return the 3n+1 sequence for n

Solution 693508

Submitted on 29 Jun 2015 by Mark Orloff
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; c_correct = 1; assert(isequal(collatz(n),c_correct))

c = 1 j = 1 count = 2

2   Pass
%% n = 2; c_correct = [2 1]; assert(isequal(collatz(n),c_correct))

c = 2 j = 2 count = 2 c = 2 1 count = 3

3   Pass
%% n = 5; c_correct = [5 16 8 4 2 1]; assert(isequal(collatz(n),c_correct))

c = 5 j = 5 count = 2 c = 5 16 count = 3 c = 5 16 8 count = 4 c = 5 16 8 4 count = 5 c = 5 16 8 4 2 count = 6 c = 5 16 8 4 2 1 count = 7

4   Pass
%% n = 22; c_correct = [22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1]; assert(isequal(collatz(n),c_correct))

c = 22 j = 22 count = 2 c = 22 11 count = 3 c = 22 11 34 count = 4 c = 22 11 34 17 count = 5 c = 22 11 34 17 52 count = 6 c = 22 11 34 17 52 26 count = 7 c = 22 11 34 17 52 26 13 count = 8 c = 22 11 34 17 52 26 13 40 count = 9 c = 22 11 34 17 52 26 13 40 20 count = 10 c = 22 11 34 17 52 26 13 40 20 10 count = 11 c = 22 11 34 17 52 26 13 40 20 10 5 count = 12 c = 22 11 34 17 52 26 13 40 20 10 5 16 count = 13 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 count = 14 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 count = 15 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 count = 16 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 count = 17