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 | Fail |
x = [0,1,2,3,4];
y_correct = [4,3,2,1,0];
assert(isequal(desSort(x),y_correct))
y =
4
x =
0 1 2 3 999
y =
4 999
x =
0 1 2 3 999
y =
4 999 999
x =
0 1 2 3 999
y =
4 999 999 999
x =
0 1 2 3 999
y =
4 999 999 999 999
x =
0 1 2 3 999
|
525 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
262 Solvers
367 Solvers
296 Solvers