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 = [4 5 1 2 9];
y_correct = [1 2 4 5 9];
assert(isequal(ascending_order(x),y_correct))
|
2 | Pass |
x = [10 8 -4 3 1 -1 0];
y_correct = [-4 -1 0 1 3 8 10];
assert(isequal(ascending_order(x),y_correct))
|
3 | Pass |
x = 0;
y_correct = 0;
assert(isequal(ascending_order(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
3369 Solvers
Increment a number, given its digits
562 Solvers
242 Solvers
286 Solvers
261 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!