Test  Status  Code Input and Output 

1  Pass 
x = [];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
s =
0 0
tf =
logical
1
y =
[]

2  Pass 
x = [1e100; 1e100];
y_correct = [1e100];
assert(isequal(common_by_row(x),y_correct))
s =
2 1
a =
1.0000e+100
n =
0
tf =
logical
0
a =
1.0000e+100
y =
1.0000e+100

3  Pass 
x = [1; 2];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
s =
2 1
n =
0
tf =
logical
1
y =
[]

4  Pass 
x = ones(10);
y_correct = [1];
assert(isequal(common_by_row(x),y_correct))
s =
10 10
a =
1
n =
0
a =
1 1
n =
0
a =
1 1 1
n =
0
a =
1 1 1 1
n =
0
a =
1 1 1 1 1
n =
0
a =
1 1 1 1 1 1
n =
0
a =
1 1 1 1 1 1 1
n =
0
a =
1 1 1 1 1 1 1 1
n =
0
a =
1 1 1 1 1 1 1 1 1
n =
0
a =
1 1 1 1 1 1 1 1 1 1
n =
0
tf =
logical
0
a =
1
y =
1

5  Pass 
x = magic(10);
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
s =
10 10
n =
0
n =
0
n =
0
n =
0
n =
0
n =
0
n =
0
n =
0
n =
0
n =
0
tf =
logical
1
y =
[]

6  Pass 
x = wilkinson(9);
y_correct = [0 1];
assert(isequal(common_by_row(x),y_correct))
s =
9 9
n =
0
a =
1
n =
0
a =
1 0
n =
0
a =
1 0 0
n =
0
a =
1 0 0 0
n =
0
a =
1 0 0 0 0
n =
0
a =
1 0 0 0 0 0
n =
0
a =
1 0 0 0 0 0 0
n =
0
a =
1 0 0 0 0 0 0 0
n =
0
tf =
logical
0
a =
0 1
y =
0 1

7  Pass 
x = [3 2 1 NaN; NaN 0 2 3];
y_correct = [2 3];
assert(isequal(common_by_row(x),y_correct))
s =
2 4
a =
3
n =
0
a =
3 2
n =
0
n =
0
n =
0
tf =
logical
0
a =
2 3
y =
2 3

37678 Solvers
Return the 3n+1 sequence for n
5329 Solvers
137 Solvers
Arrange Vector in descending order
2000 Solvers
389 Solvers