Introduction to Programming With Fortran 2015
DOI: 10.1007/978-3-319-17701-4_23
|View full text |Cite
|
Sign up to set email alerts
|

An Introduction to Algorithms and the Big O Notation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 62 publications
(21 citation statements)
references
References 0 publications
0
20
0
1
Order By: Relevance
“…An example of multiple pollution sources using our blockchain with a DAG approach is also provided in the Supplementary section . Details of the big O notation can be found in Avigad and Donnelly [ 39 ] and Chivers and Sleightholme [ 40 ].…”
Section: Methodsmentioning
confidence: 99%
“…An example of multiple pollution sources using our blockchain with a DAG approach is also provided in the Supplementary section . Details of the big O notation can be found in Avigad and Donnelly [ 39 ] and Chivers and Sleightholme [ 40 ].…”
Section: Methodsmentioning
confidence: 99%
“…pacing_gain = P down 3: return 4: end if Phase 3: next six cycles 1: if pacing gain == 1.0 then 2: return 3: end if Algorithm 1 gives the pseudo code of BBR-GC, which is an improvement of BBR algorithm. The algorithm complexity analysis uses the big O notation [39,40], which can be divided into time complexity and space complexity. This method uses another function (usually simpler) to describe the asymptotic upper bound of the order of magnitude of a function.…”
Section: Design Motivationmentioning
confidence: 99%
“…Such an evaluation was made by analyzing the theoretical complexity of the events classification (Algorithm 1) and the events features transformation (Algorithm 2), as previously formalized. The complexity is expressed according to the Big O notation [96], which is aimed to define the upper bound of an algorithm, since it bounds a function only from above.…”
Section: Computational Complexitymentioning
confidence: 99%