Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 10;
flagSame = isequal(makeRandomOrdering(n), makeRandomOrdering(n));
flagAllUsed = isequal([1:n],sort(makeRandomOrdering(n)));
assert(~flagSame & flagAllUsed)
|
1878 Solvers
794 Solvers
Sum of first n terms of a harmonic progression
188 Solvers
Calculate the area of a triangle between three points
278 Solvers
385 Solvers