Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [-1,-1,1,1];
y = [-1,1,1,-1];
d_correct = true;
assert(isequal(isSortedClockwise(x,y),d_correct))
|
2 | Pass |
x = [-1,-1,-2,-2];
y = [-1,1,1,-1];
d_correct = false;
assert(isequal(isSortedClockwise(x,y),d_correct))
|
3 | Pass |
x = [-1,-1,-2,-2];
y = [-1,1,1,-1];
d_correct = false;
assert(isequal(isSortedClockwise(x,y),d_correct))
|
4 | Pass |
x = [-6,-7,-2,1,1,-2];
y = [4,-7,-13,-11,0,5];
d_correct = false;
assert(isequal(isSortedClockwise(x,y),d_correct))
|
5 | Pass |
x = [-59,-59,-55,-51,-50,-46,-45,-45,-39,-40,-40,-41,-46,-50,-50];
y = [-68,-33, -5,-13,-28,-30,-20,-10, -8,-23,-34,-45,-48,-51,-51];
d_correct = true;
assert(isequal(isSortedClockwise(x,y),d_correct))
|
6 | Pass |
x = flip([-59,-59,-55,-51,-50,-46,-45,-45,-39,-40,-40,-41,-46,-50,-50]);
y = flip([-68,-33, -5,-13,-28,-30,-20,-10, -8,-23,-34,-45,-48,-51,-51]);
d_correct = false;
assert(isequal(isSortedClockwise(x,y),d_correct))
|
7 | Pass |
x = [1,1,2,2];
y = [2,1,1,2];
assert(isequal(isSortedClockwise(x,y),false));
|
8 | Pass |
x = flip([1,1,2,2]);
y = flip([2,1,1,2]);
assert(isequal(isSortedClockwise(x,y),true));
|
9 | Pass |
x = [-2,-2,-4,-4];
y = [1,3,1,-1];
assert(isequal(isSortedClockwise(x,y),false));
|
10 | Pass |
x = flip([-2,-2,-4,-4]);
y = flip([1,3,1,-1]);
assert(isequal(isSortedClockwise(x,y),true));
|
11 | Pass |
r=rand(100,15);
a=2*pi*rand(100,1);
d=2*(rand(100,1)>.5)-1;
x=r.*cos(a*ones(1,15)+d*2*pi*(0:14)/15)+randn(100,1);
y=r.*sin(a*ones(1,15)+d*2*pi*(0:14)/15)+randn(100,1);
assert(all(arrayfun(@(i)isequal(isSortedClockwise(x(i,:),y(i,:)),d(i)<0),1:100)))
|
951 Solvers
"Low : High - Low : High - Turn around " -- Create a subindices vector
320 Solvers
How long is the longest prime diagonal?
338 Solvers
Circular Primes (based on Project Euler, problem 35)
140 Solvers
170 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!