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 = [1 5 8 9 7 4 5];
y_correct = roots(x);
assert(isequal(return_root(x),y_correct))
x = [1 0 0 48 50];
y_correct = roots(x);
assert(isequal(return_root(x),y_correct))
x = [11 55 4 6 ];
y_correct = roots(x)
assert(isequal(return_root(x),y_correct))
y_correct =
-4.9488 + 0.0000i
-0.0256 + 0.3310i
-0.0256 - 0.3310i
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
29469 Solvers
Find the longest sequence of 1's in a binary sequence.
2446 Solvers
190 Solvers
Switch matrix to a column vector
189 Solvers
123 Solvers