Problem 34. Binary numbers

Solution 824453

Submitted on 11 Feb 2016 by Brendan Gray

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

Brendan Gray on 11 Feb 2016

The test suite is poorly designed. A better test would be
assert(length(unique(sum(A.*repmat(2.^(0:(n-1)),2^n,1),2)))==2^n)

Test	Status	Code Input and Output
1	Pass	%% n = 2; A = binary_numbers(n); assert(isequal(class(A), 'double'))
2	Pass	%% n = 3; A = binary_numbers(n); assert(all(A(:) == 0 \| A(:) == 1))
3	Pass	%% n = 5; A = binary_numbers(n); assert(isequal(size(A),[32 5]))
4	Pass	%% n = 10; A = binary_numbers(n); assert(isequal(size(unique(A,'rows'),1),1024))
5	Pass	%% n = 1; A = binary_numbers(n); assert(isequal(A,[0;1]) \|\| isequal(A,[1;0]))