Solution 366927

Submitted on 9 Dec 2013 by Neil Caithness

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

2 Comments

2 Comments

yeungor on 19 May 2017

I don't think you should hard code the lists you should be constructing. Regex is fine, but you're limiting yourself by making such a narrow solution.
I personally don't like the regex solution because I'm trying to find interesting things about the language and I don't want to run through and find the shortest non regexp.

Oliviero Allan Ceresa Genet on 11 Nov 2017

Now give me 500$

Test Suite

Test	Status	Code Input and Output
1	Pass	%% n = 1; c_correct = 1; assert(isequal(collatz(n),c_correct))
2	Pass	%% n = 2; c_correct = [2 1]; assert(isequal(collatz(n),c_correct))
3	Pass	%% n = 5; c_correct = [5 16 8 4 2 1]; assert(isequal(collatz(n),c_correct))
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))

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

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

Test Suite

Suggested Problems

More from this Author95

Community Treasure Hunt

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

Test Suite

Suggested Problems

More from this Author95

Community Treasure Hunt

Players