Cody

# Problem 793. Combinations without using nchoosek

Solution 1815290

Submitted on 14 May 2019 by Gareth Davies
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 = 3; y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) % Prevents cheating filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

filetext = 'function output = your_fcn_name(n) m = [1 2]; output(1,:) = m; i = 2; while m(1) < (n - 1) m(2) = m(2) + 1; if m(2) > n m(1) = m(1) + 1; m(2) = m(1) + 1; end output(i,:) = m; i = i + 1; end end %This code written by profile_id 13881805 '

2   Pass
n = 25; y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

filetext = 'function output = your_fcn_name(n) m = [1 2]; output(1,:) = m; i = 2; while m(1) < (n - 1) m(2) = m(2) + 1; if m(2) > n m(1) = m(1) + 1; m(2) = m(1) + 1; end output(i,:) = m; i = i + 1; end end %This code written by profile_id 13881805 '

3   Pass
n = 112; y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

filetext = 'function output = your_fcn_name(n) m = [1 2]; output(1,:) = m; i = 2; while m(1) < (n - 1) m(2) = m(2) + 1; if m(2) > n m(1) = m(1) + 1; m(2) = m(1) + 1; end output(i,:) = m; i = i + 1; end end %This code written by profile_id 13881805 '

4   Pass
n = 2 y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

n = 2 filetext = 'function output = your_fcn_name(n) m = [1 2]; output(1,:) = m; i = 2; while m(1) < (n - 1) m(2) = m(2) + 1; if m(2) > n m(1) = m(1) + 1; m(2) = m(1) + 1; end output(i,:) = m; i = i + 1; end end %This code written by profile_id 13881805 '