Why big-\(O\) and little-\(o\) in algorithm complexity: a pedagogical remark (Q2959241)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6682748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Why big-\(O\) and little-\(o\) in algorithm complexity: a pedagogical remark |
scientific article; zbMATH DE number 6682748 |
Statements
9 February 2017
0 references
algorithm analysis
0 references
0.7042432427406311
0 references
0.7040817737579346
0 references
0.6639485955238342
0 references
