Problem 1488. Generate binary combinations for a given number of bit(s)

Solution 242820

Submitted on 11 May 2013 by Suman Saha

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

Test	Status	Code Input and Output
1	Pass	%% bits = 1; y_correct = [0; 1]; assert(isequal(bin_comb(bits),y_correct)) b = 0 1
2	Pass	%% bits = 2; y_correct = [0 0;0 1; 1 0; 1 1] assert(isequal(bin_comb(bits),y_correct)) y_correct = 0 0 0 1 1 0 1 1 b = 0 0 0 1 1 0 1 1
3	Pass	%% bits = 3; y_correct = [0 0 0;0 0 1;0 1 0;0 1 1;1 0 0; 1 0 1; 1 1 0; 1 1 1] assert(isequal(bin_comb(bits),y_correct)) y_correct = 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 b = 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

Test

Status

Code Input and Output

Pass

%% bits = 1; y_correct = [0; 1]; assert(isequal(bin_comb(bits),y_correct))

b = 0 1

Pass

%% bits = 2; y_correct = [0 0;0 1; 1 0; 1 1] assert(isequal(bin_comb(bits),y_correct))

y_correct = 0 0 0 1 1 0 1 1 b = 0 0 0 1 1 0 1 1

Pass

%% bits = 3; y_correct = [0 0 0;0 0 1;0 1 0;0 1 1;1 0 0; 1 0 1; 1 1 0; 1 1 1] assert(isequal(bin_comb(bits),y_correct))

y_correct = 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 b = 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1