Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = [ 3 8 7 5 0 9 2 1 6 4];
b= [ 2 4 5 5 3 3 3 9 0];
c_correct =[3,3,3,5,5,0,9,2,4];
assert(isequal(ak_sorting(a,b),c_correct))
|
2 | Pass |
a = [ 0 1 2 3 4 5 6 7 8 9];
b= [ 5 6 7 3 5 1 9 0 5 6 7 8 2 4 5];
c_correct = [0 1 2 3 4 5 5 5 5 6 6 7 7 8 9];
assert(isequal(ak_sorting(a,b),c_correct))
|
3 | Pass |
a = [ 9 8 7 6 5 4 3 2 1 0];
b= [3 4 1 2 3 4 1 2 3 4 1 2];
c_correct = [4 4 4 3 3 3 2 2 2 1 1 1];
assert(isequal(ak_sorting(a,b),c_correct))
|
4 | Pass |
a = [4 5 7 8 0 3 1 2 9 6];
b= [5 4 3 8 7 6 5 4 3 5 3 2 1 0 9 1];
c_correct = [4 4 5 5 5 7 8 0 3 3 3 1 1 2 9 6];
assert(isequal(ak_sorting(a,b),c_correct))
|
Count from 0 to N^M in base N.
220 Solvers
Test if a Number is a Palindrome without using any String Operations
181 Solvers
516 Solvers
206 Solvers
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
168 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!