From 1f3cba06e4f50bc35aa24941b58ae41fc2ada40e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Tobias=20Ulvg=C3=A5rd?= <tobias.ulvgard@gmail.com>
Date: Mon, 10 Dec 2018 16:15:34 +0100
Subject: [PATCH] Update reference to complexity calculation (#723)

---
 src/complexity.cc | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/complexity.cc b/src/complexity.cc
index 0be73e08..6ef17660 100644
--- a/src/complexity.cc
+++ b/src/complexity.cc
@@ -73,8 +73,8 @@ std::string GetBigOString(BigO complexity) {
 //   - time          : Vector containing the times for the benchmark tests.
 //   - fitting_curve : lambda expression (e.g. [](int64_t n) {return n; };).
 
-// For a deeper explanation on the algorithm logic, look the README file at
-// http://github.com/ismaelJimenez/Minimal-Cpp-Least-Squared-Fit
+// For a deeper explanation on the algorithm logic, please refer to
+// https://en.wikipedia.org/wiki/Least_squares#Least_squares,_regression_analysis_and_statistics
 
 LeastSq MinimalLeastSq(const std::vector<int64_t>& n,
                        const std::vector<double>& time,