Fixed codes

Author: mmiranda96

src/matrices/cramer.sci

@@ -1,16 +1,15 @@
-function [R] = cramer(A, B)
-    s = size(A);
-    detS = det(A);
-    R = zeros(s(1), 1);
-    for i = 1 : s(1)
-        t = A(:, i);
-        A(:, i) = B;
-        R(i) = det(A) / detS;
-        A(:, i) = t;
-    end
-endfunction
-
-A = [3., -0.1, -0.2; 0.1, 7., -0.3; 0.3, -0.2, 10.]
-B = [7.85; -19.3; 71.4]
-
-R = cramer(A, B)
+function [R] = cramer(A, B)
+    s = size(A);
+    detS = det(A);
+    R = zeros(s(1), 1);
+    for i = 1 : s(1)
+        t = A(:, i);
+        A(:, i) = B;
+        R(i) = det(A) / detS;
+        A(:, i) = t;
+    end
+endfunction
+
+A = [1., 2.; 1., -2.]
+B = [9.; 1.]
+S = cramer(A, B)

src/root_finder/bairstow.cpp

@@ -1,6 +1,7 @@
 #include <iostream>
 #include <cmath>
 #include <vector>
+#include <stdlib.h>
 
 using namespace std;
 
@@ -135,7 +136,15 @@ void bairstow(vector<double> &pol, vector<complex*> &roots, double pi, double qi
 }
 
 int main(int argc, char* argv[]) {
-  vector<double> pol = {1, -3, 2.2, 1.22, -0.02, 189};
+  if (argc < 3) {
+    cerr << "This method receives a polynomial of minimum grade = 2, expressed from more significant coefficient to less significant." << endl;
+    return -1;
+  }
+  vector<double> pol(argc - 1, 0);
+  cout << pol.size() << endl;
+  for (int i = 1; i < argc; i++) {
+    pol[i - 1] = atof(argv[i]);
+  }
   vector<complex*> roots;
   double p = -1;
   double q = -1;

src/root_finder/secant.cpp

@@ -5,7 +5,7 @@
 using namespace std;
 
 double f(double x) {
-  double fx = log(abs(x)); //Something
+  double fx = pow(x, 3) + 10 * x + 5; //Something
   if (isnan(fx)) {
     cerr << "Function is discontinuous on " << x << endl;
   }