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 |
%%
x = sort(rand(1,10^5));
y_correct = 1;
assert(isequal(sortok(x),y_correct))
|
2 | Pass |
%%
x = [1 5 4 3 8 7 3];
y_correct = 0;
assert(isequal(sortok(x),y_correct))
|
Back to basics 12 - Input Arguments
467 Solvers
367 Solvers
Find nearest prime number less than input number
183 Solvers
377 Solvers
600 Solvers