Cody

Problem 793. Combinations without using nchoosek

Solution 132061

Submitted on 28 Aug 2012
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) output = perms(1:n); output = unique(sort(output(:,1:2),2),'rows'); end %This code written by profile_id 734801 ```

2   Fail
%% 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')))

```Error: Out of memory. Type HELP MEMORY for your options. ```

3   Fail
%% 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')))

```Error: Out of memory. Type HELP MEMORY for your options. ```

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) output = perms(1:n); output = unique(sort(output(:,1:2),2),'rows'); end %This code written by profile_id 734801 ```