Skip to content

B
benchmark
Commit fed9b6f2 by Ismael
Options

refactor least square .h

parent 266addc3
Showing with 1 addition and 1 deletion
src/minimal_leastsq.h
...@@ -41,6 +41,6 @@ struct LeastSq { ...@@ -41,6 +41,6 @@ struct LeastSq {
}; };
// Find the coefficient for the high-order term in the running time, by minimizing the sum of squares of relative error. // Find the coefficient for the high-order term in the running time, by minimizing the sum of squares of relative error.
LeastSq MinimalLeastSq(const std::vector<int>& N, const std::vector<double>& Time, const benchmark::BigO Complexity = benchmark::oAuto); LeastSq MinimalLeastSq(const std::vector<int>& n, const std::vector<double>& time, const benchmark::BigO vomplexity = benchmark::oAuto);
#endif #endif
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment