Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = rand(10000, 1);
z = rand(10000, 1);
x = vertcat(x, z);
tic
y_correct = unique(x);
t_unique = toc
tic
y_myunique = my_unique(x);
t_myunique = toc
assert(isequal(sort(my_unique(x)),y_correct) && t_unique > t_myunique)
t_unique =
0.0291
t_myunique =
1.2000e-05
|
2 | Pass |
%%
x = rand(50000, 1);
z = rand(50000, 1);
x = vertcat(x, z);
tic
y_correct = unique(x);
t_unique = toc
tic
y_my_unique = my_unique(x);
t_my_unique = toc
assert(isequal(sort(my_unique(x)),y_correct) && t_unique > t_my_unique)
t_unique =
0.0150
t_my_unique =
1.4000e-05
|
3 | Pass |
%%
x = [1; 2; 3; 4; 2; 3; 4; 5;];
tic
y_correct = unique(x);
t_unique = toc
tic
y_my_unique = my_unique(x);
t_my_unique = toc
assert(isequal(sort(my_unique(x)),y_correct) && t_unique > t_my_unique)
t_unique =
2.0000e-04
t_my_unique =
9.0000e-06
|
116 Solvers
What is the distance from point P(x,y) to the line Ax + By + C = 0?
209 Solvers
Choose the best fitting dominoes
161 Solvers
189 Solvers
309 Solvers