refactor least square .h
diff --git a/src/minimal_leastsq.h b/src/minimal_leastsq.h
index 3f7be34..8feb43d 100644
--- a/src/minimal_leastsq.h
+++ b/src/minimal_leastsq.h
@@ -41,6 +41,6 @@
};
// 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
