Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
B
benchmark
Project
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Chen Yisong
benchmark
Commits
1f3cba06
Commit
1f3cba06
authored
Dec 10, 2018
by
Tobias Ulvgård
Committed by
Dominic Hamon
Dec 10, 2018
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update reference to complexity calculation (#723)
parent
5cb8f8a0
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
complexity.cc
src/complexity.cc
+2
-2
No files found.
src/complexity.cc
View file @
1f3cba06
...
@@ -73,8 +73,8 @@ std::string GetBigOString(BigO complexity) {
...
@@ -73,8 +73,8 @@ std::string GetBigOString(BigO complexity) {
// - time : Vector containing the times for the benchmark tests.
// - time : Vector containing the times for the benchmark tests.
// - fitting_curve : lambda expression (e.g. [](int64_t n) {return n; };).
// - fitting_curve : lambda expression (e.g. [](int64_t n) {return n; };).
// For a deeper explanation on the algorithm logic,
look the README file at
// For a deeper explanation on the algorithm logic,
please refer to
// http
://github.com/ismaelJimenez/Minimal-Cpp-Least-Squared-Fit
// http
s://en.wikipedia.org/wiki/Least_squares#Least_squares,_regression_analysis_and_statistics
LeastSq
MinimalLeastSq
(
const
std
::
vector
<
int64_t
>&
n
,
LeastSq
MinimalLeastSq
(
const
std
::
vector
<
int64_t
>&
n
,
const
std
::
vector
<
double
>&
time
,
const
std
::
vector
<
double
>&
time
,
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment